./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:12:02,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:12:02,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:12:02,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:12:02,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:12:02,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:12:02,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:12:02,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:12:02,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:12:02,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:12:02,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:12:02,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:12:02,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:12:02,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:12:02,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:12:02,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:12:02,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:12:02,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:12:02,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:12:02,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:12:02,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:12:02,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:12:02,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:12:02,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:12:02,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:12:02,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:12:02,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:12:02,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:12:02,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:12:02,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:12:02,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:12:02,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:12:02,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:12:02,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:12:02,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:12:02,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:12:02,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:12:02,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:12:02,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:12:02,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:12:02,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:12:02,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:12:02,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2024-10-13 02:12:02,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:12:02,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:12:02,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:12:02,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:12:02,560 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:12:02,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-10-13 02:12:04,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:12:04,383 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:12:04,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-10-13 02:12:04,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67ce90ad/efed6d6bce0d41ad944004803acd83d7/FLAG0d307282b [2024-10-13 02:12:04,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67ce90ad/efed6d6bce0d41ad944004803acd83d7 [2024-10-13 02:12:04,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:12:04,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:12:04,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:12:04,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:12:04,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:12:04,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3353f0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04, skipping insertion in model container [2024-10-13 02:12:04,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:12:04,661 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-10-13 02:12:04,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:12:04,758 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:12:04,770 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-10-13 02:12:04,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:12:04,824 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:12:04,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04 WrapperNode [2024-10-13 02:12:04,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:12:04,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:12:04,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:12:04,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:12:04,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,912 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-10-13 02:12:04,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:12:04,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:12:04,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:12:04,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:12:04,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:12:04,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:04,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:05,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:05,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:05,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:12:05,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:12:05,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:12:05,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:12:05,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (1/1) ... [2024-10-13 02:12:05,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:12:05,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:12:05,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:12:05,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:12:05,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:12:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:12:05,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:12:05,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:12:05,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:12:05,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:12:05,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:12:05,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:12:05,779 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-13 02:12:05,779 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:12:05,820 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:12:05,821 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:12:05,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:12:05 BoogieIcfgContainer [2024-10-13 02:12:05,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:12:05,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:12:05,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:12:05,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:12:05,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:12:04" (1/3) ... [2024-10-13 02:12:05,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7100a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:12:05, skipping insertion in model container [2024-10-13 02:12:05,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:04" (2/3) ... [2024-10-13 02:12:05,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7100a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:12:05, skipping insertion in model container [2024-10-13 02:12:05,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:12:05" (3/3) ... [2024-10-13 02:12:05,831 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-10-13 02:12:05,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:12:05,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:12:05,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:12:05,919 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fdd74ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:12:05,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:12:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 02:12:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:12:05,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:05,942 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:05,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1059409462, now seen corresponding path program 1 times [2024-10-13 02:12:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48991788] [2024-10-13 02:12:05,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48991788] [2024-10-13 02:12:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48991788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:06,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:06,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:12:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960678583] [2024-10-13 02:12:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:06,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:12:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:12:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:12:06,482 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 68 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 02:12:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:06,537 INFO L93 Difference]: Finished difference Result 181 states and 312 transitions. [2024-10-13 02:12:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:12:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2024-10-13 02:12:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:06,552 INFO L225 Difference]: With dead ends: 181 [2024-10-13 02:12:06,552 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 02:12:06,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:12:06,561 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:06,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:12:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 02:12:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 02:12:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 66 states have internal predecessors, (97), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 02:12:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-10-13 02:12:06,617 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 154 [2024-10-13 02:12:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:06,618 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-10-13 02:12:06,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 02:12:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-10-13 02:12:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:12:06,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:06,624 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:12:06,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash 10153666, now seen corresponding path program 1 times [2024-10-13 02:12:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469652987] [2024-10-13 02:12:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:06,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469652987] [2024-10-13 02:12:06,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469652987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:06,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:06,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:12:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753657759] [2024-10-13 02:12:06,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:12:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:12:06,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:06,987 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:07,076 INFO L93 Difference]: Finished difference Result 224 states and 353 transitions. [2024-10-13 02:12:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:12:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-10-13 02:12:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:07,080 INFO L225 Difference]: With dead ends: 224 [2024-10-13 02:12:07,080 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 02:12:07,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:07,082 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:07,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:12:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 02:12:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2024-10-13 02:12:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 88 states have internal predecessors, (133), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 02:12:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 177 transitions. [2024-10-13 02:12:07,112 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 177 transitions. Word has length 154 [2024-10-13 02:12:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:07,114 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 177 transitions. [2024-10-13 02:12:07,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 177 transitions. [2024-10-13 02:12:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:12:07,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:07,123 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:07,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:12:07,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:07,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash 150702276, now seen corresponding path program 1 times [2024-10-13 02:12:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503013587] [2024-10-13 02:12:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503013587] [2024-10-13 02:12:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503013587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:07,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:12:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681732116] [2024-10-13 02:12:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:07,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:12:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:12:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:12:07,817 INFO L87 Difference]: Start difference. First operand 112 states and 177 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:08,433 INFO L93 Difference]: Finished difference Result 449 states and 713 transitions. [2024-10-13 02:12:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:12:08,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-10-13 02:12:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:08,441 INFO L225 Difference]: With dead ends: 449 [2024-10-13 02:12:08,442 INFO L226 Difference]: Without dead ends: 338 [2024-10-13 02:12:08,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:12:08,444 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 227 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:08,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 568 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:12:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-13 02:12:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 259. [2024-10-13 02:12:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 212 states have (on average 1.528301886792453) internal successors, (324), 212 states have internal predecessors, (324), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 412 transitions. [2024-10-13 02:12:08,496 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 412 transitions. Word has length 154 [2024-10-13 02:12:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 412 transitions. [2024-10-13 02:12:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 412 transitions. [2024-10-13 02:12:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 02:12:08,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:08,503 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:08,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:12:08,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:08,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash 142400452, now seen corresponding path program 1 times [2024-10-13 02:12:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:08,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116578594] [2024-10-13 02:12:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:08,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116578594] [2024-10-13 02:12:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116578594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:12:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993880959] [2024-10-13 02:12:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:08,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:12:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:12:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:12:08,860 INFO L87 Difference]: Start difference. First operand 259 states and 412 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:09,206 INFO L93 Difference]: Finished difference Result 738 states and 1159 transitions. [2024-10-13 02:12:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:12:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-10-13 02:12:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:09,215 INFO L225 Difference]: With dead ends: 738 [2024-10-13 02:12:09,215 INFO L226 Difference]: Without dead ends: 480 [2024-10-13 02:12:09,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:12:09,220 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 238 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:09,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 399 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:12:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-13 02:12:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 303. [2024-10-13 02:12:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 256 states have (on average 1.5234375) internal successors, (390), 256 states have internal predecessors, (390), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 478 transitions. [2024-10-13 02:12:09,275 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 478 transitions. Word has length 154 [2024-10-13 02:12:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:09,276 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 478 transitions. [2024-10-13 02:12:09,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 478 transitions. [2024-10-13 02:12:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 02:12:09,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:09,281 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:09,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:12:09,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 839567455, now seen corresponding path program 1 times [2024-10-13 02:12:09,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:09,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801708720] [2024-10-13 02:12:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801708720] [2024-10-13 02:12:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801708720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:12:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119676618] [2024-10-13 02:12:09,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:09,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:12:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:09,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:12:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:09,499 INFO L87 Difference]: Start difference. First operand 303 states and 478 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:09,609 INFO L93 Difference]: Finished difference Result 709 states and 1108 transitions. [2024-10-13 02:12:09,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:12:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-10-13 02:12:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:09,613 INFO L225 Difference]: With dead ends: 709 [2024-10-13 02:12:09,614 INFO L226 Difference]: Without dead ends: 407 [2024-10-13 02:12:09,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:09,616 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 99 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:09,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 264 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:12:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-13 02:12:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 303. [2024-10-13 02:12:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 256 states have (on average 1.515625) internal successors, (388), 256 states have internal predecessors, (388), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 476 transitions. [2024-10-13 02:12:09,659 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 476 transitions. Word has length 155 [2024-10-13 02:12:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:09,660 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 476 transitions. [2024-10-13 02:12:09,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 476 transitions. [2024-10-13 02:12:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 02:12:09,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:09,662 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:09,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:12:09,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:09,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1239631106, now seen corresponding path program 1 times [2024-10-13 02:12:09,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:09,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691707777] [2024-10-13 02:12:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691707777] [2024-10-13 02:12:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691707777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:12:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951540829] [2024-10-13 02:12:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:09,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:12:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:12:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:12:09,996 INFO L87 Difference]: Start difference. First operand 303 states and 476 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:10,253 INFO L93 Difference]: Finished difference Result 815 states and 1275 transitions. [2024-10-13 02:12:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:12:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-10-13 02:12:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:10,257 INFO L225 Difference]: With dead ends: 815 [2024-10-13 02:12:10,257 INFO L226 Difference]: Without dead ends: 491 [2024-10-13 02:12:10,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:12:10,262 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 287 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:10,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 236 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:12:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-13 02:12:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2024-10-13 02:12:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 322 states have (on average 1.4720496894409938) internal successors, (474), 322 states have internal predecessors, (474), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 562 transitions. [2024-10-13 02:12:10,321 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 562 transitions. Word has length 155 [2024-10-13 02:12:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 562 transitions. [2024-10-13 02:12:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 562 transitions. [2024-10-13 02:12:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:12:10,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:10,325 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:10,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:12:10,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1874445539, now seen corresponding path program 1 times [2024-10-13 02:12:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828436252] [2024-10-13 02:12:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:10,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:10,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828436252] [2024-10-13 02:12:10,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828436252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:10,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:10,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:12:10,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397291995] [2024-10-13 02:12:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:10,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:12:10,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:10,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:12:10,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:12:10,775 INFO L87 Difference]: Start difference. First operand 369 states and 562 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:11,129 INFO L93 Difference]: Finished difference Result 877 states and 1324 transitions. [2024-10-13 02:12:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:12:11,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-10-13 02:12:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:11,134 INFO L225 Difference]: With dead ends: 877 [2024-10-13 02:12:11,135 INFO L226 Difference]: Without dead ends: 509 [2024-10-13 02:12:11,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:11,137 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 84 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:11,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 754 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:12:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-13 02:12:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 409. [2024-10-13 02:12:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 614 transitions. [2024-10-13 02:12:11,204 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 614 transitions. Word has length 156 [2024-10-13 02:12:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:11,205 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 614 transitions. [2024-10-13 02:12:11,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 614 transitions. [2024-10-13 02:12:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:12:11,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:11,207 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:11,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:12:11,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:11,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash -219163598, now seen corresponding path program 1 times [2024-10-13 02:12:11,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:11,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115832613] [2024-10-13 02:12:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:11,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:11,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115832613] [2024-10-13 02:12:11,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115832613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:11,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:11,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:12:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026993784] [2024-10-13 02:12:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:11,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:12:11,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:11,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:12:11,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:11,325 INFO L87 Difference]: Start difference. First operand 409 states and 614 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:11,455 INFO L93 Difference]: Finished difference Result 965 states and 1444 transitions. [2024-10-13 02:12:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:12:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-10-13 02:12:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:11,459 INFO L225 Difference]: With dead ends: 965 [2024-10-13 02:12:11,459 INFO L226 Difference]: Without dead ends: 557 [2024-10-13 02:12:11,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:11,462 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 121 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:11,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 269 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:12:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-13 02:12:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 443. [2024-10-13 02:12:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 396 states have (on average 1.4292929292929293) internal successors, (566), 396 states have internal predecessors, (566), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 654 transitions. [2024-10-13 02:12:11,521 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 654 transitions. Word has length 156 [2024-10-13 02:12:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:11,523 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 654 transitions. [2024-10-13 02:12:11,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 654 transitions. [2024-10-13 02:12:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 02:12:11,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:11,527 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:11,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:12:11,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:11,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1013376868, now seen corresponding path program 1 times [2024-10-13 02:12:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928102512] [2024-10-13 02:12:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928102512] [2024-10-13 02:12:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928102512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:12:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521053207] [2024-10-13 02:12:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:12:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:12:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:12,046 INFO L87 Difference]: Start difference. First operand 443 states and 654 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:12,377 INFO L93 Difference]: Finished difference Result 1104 states and 1589 transitions. [2024-10-13 02:12:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:12:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-10-13 02:12:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:12,382 INFO L225 Difference]: With dead ends: 1104 [2024-10-13 02:12:12,382 INFO L226 Difference]: Without dead ends: 662 [2024-10-13 02:12:12,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:12:12,385 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 72 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:12,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 635 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:12:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-10-13 02:12:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 443. [2024-10-13 02:12:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 396 states have (on average 1.4292929292929293) internal successors, (566), 396 states have internal predecessors, (566), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 654 transitions. [2024-10-13 02:12:12,442 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 654 transitions. Word has length 157 [2024-10-13 02:12:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:12,442 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 654 transitions. [2024-10-13 02:12:12,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 654 transitions. [2024-10-13 02:12:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 02:12:12,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:12,446 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 02:12:12,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2062768175, now seen corresponding path program 1 times [2024-10-13 02:12:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062856136] [2024-10-13 02:12:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062856136] [2024-10-13 02:12:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062856136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:12,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:12,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:12:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083880869] [2024-10-13 02:12:12,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:12:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:12:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:12:12,901 INFO L87 Difference]: Start difference. First operand 443 states and 654 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:14,344 INFO L93 Difference]: Finished difference Result 1784 states and 2637 transitions. [2024-10-13 02:12:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:12:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-10-13 02:12:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:14,351 INFO L225 Difference]: With dead ends: 1784 [2024-10-13 02:12:14,351 INFO L226 Difference]: Without dead ends: 1342 [2024-10-13 02:12:14,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:12:14,353 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 406 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:14,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 755 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:12:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-10-13 02:12:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 895. [2024-10-13 02:12:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 802 states have (on average 1.4089775561097257) internal successors, (1130), 802 states have internal predecessors, (1130), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1306 transitions. [2024-10-13 02:12:14,472 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1306 transitions. Word has length 157 [2024-10-13 02:12:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:14,473 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1306 transitions. [2024-10-13 02:12:14,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1306 transitions. [2024-10-13 02:12:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 02:12:14,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:14,477 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:14,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 02:12:14,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash 68623469, now seen corresponding path program 1 times [2024-10-13 02:12:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022731830] [2024-10-13 02:12:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:15,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:15,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022731830] [2024-10-13 02:12:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022731830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 02:12:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634544526] [2024-10-13 02:12:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:15,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 02:12:15,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 02:12:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:12:15,004 INFO L87 Difference]: Start difference. First operand 895 states and 1306 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:16,720 INFO L93 Difference]: Finished difference Result 3173 states and 4635 transitions. [2024-10-13 02:12:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 02:12:16,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-10-13 02:12:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:16,733 INFO L225 Difference]: With dead ends: 3173 [2024-10-13 02:12:16,734 INFO L226 Difference]: Without dead ends: 2279 [2024-10-13 02:12:16,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2024-10-13 02:12:16,737 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 652 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:16,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1413 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:12:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2024-10-13 02:12:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1071. [2024-10-13 02:12:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 978 states have (on average 1.3967280163599183) internal successors, (1366), 978 states have internal predecessors, (1366), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1542 transitions. [2024-10-13 02:12:16,904 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1542 transitions. Word has length 157 [2024-10-13 02:12:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:16,904 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1542 transitions. [2024-10-13 02:12:16,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1542 transitions. [2024-10-13 02:12:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 02:12:16,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:16,907 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:16,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 02:12:16,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:16,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -874470686, now seen corresponding path program 1 times [2024-10-13 02:12:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964347197] [2024-10-13 02:12:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:16,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964347197] [2024-10-13 02:12:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964347197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:12:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311761822] [2024-10-13 02:12:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:12:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:12:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:17,039 INFO L87 Difference]: Start difference. First operand 1071 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:17,143 INFO L93 Difference]: Finished difference Result 2479 states and 3515 transitions. [2024-10-13 02:12:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:12:17,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-10-13 02:12:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:17,150 INFO L225 Difference]: With dead ends: 2479 [2024-10-13 02:12:17,150 INFO L226 Difference]: Without dead ends: 1409 [2024-10-13 02:12:17,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:17,155 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 53 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:17,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 321 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:12:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-13 02:12:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1055. [2024-10-13 02:12:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 962 states have (on average 1.345114345114345) internal successors, (1294), 962 states have internal predecessors, (1294), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1470 transitions. [2024-10-13 02:12:17,270 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1470 transitions. Word has length 157 [2024-10-13 02:12:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:17,270 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1470 transitions. [2024-10-13 02:12:17,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1470 transitions. [2024-10-13 02:12:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:17,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:17,273 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:17,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 02:12:17,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1387726248, now seen corresponding path program 1 times [2024-10-13 02:12:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:17,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514542830] [2024-10-13 02:12:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514542830] [2024-10-13 02:12:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514542830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:12:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991839756] [2024-10-13 02:12:17,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:12:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:12:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:17,811 INFO L87 Difference]: Start difference. First operand 1055 states and 1470 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:18,848 INFO L93 Difference]: Finished difference Result 2404 states and 3353 transitions. [2024-10-13 02:12:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:12:18,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:18,856 INFO L225 Difference]: With dead ends: 2404 [2024-10-13 02:12:18,857 INFO L226 Difference]: Without dead ends: 1350 [2024-10-13 02:12:18,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-13 02:12:18,860 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 278 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:18,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1056 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 02:12:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-10-13 02:12:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1028. [2024-10-13 02:12:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 935 states have (on average 1.344385026737968) internal successors, (1257), 935 states have internal predecessors, (1257), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1433 transitions. [2024-10-13 02:12:18,949 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1433 transitions. Word has length 158 [2024-10-13 02:12:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:18,951 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1433 transitions. [2024-10-13 02:12:18,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1433 transitions. [2024-10-13 02:12:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:18,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:18,954 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:18,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 02:12:18,954 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:18,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2082255722, now seen corresponding path program 1 times [2024-10-13 02:12:18,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:18,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583586776] [2024-10-13 02:12:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:18,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583586776] [2024-10-13 02:12:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583586776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:19,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:19,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:12:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524385466] [2024-10-13 02:12:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:19,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:12:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:12:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:19,309 INFO L87 Difference]: Start difference. First operand 1028 states and 1433 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:20,305 INFO L93 Difference]: Finished difference Result 1991 states and 2814 transitions. [2024-10-13 02:12:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:12:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:20,313 INFO L225 Difference]: With dead ends: 1991 [2024-10-13 02:12:20,313 INFO L226 Difference]: Without dead ends: 1479 [2024-10-13 02:12:20,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-13 02:12:20,315 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 329 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:20,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 883 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:12:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-10-13 02:12:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1042. [2024-10-13 02:12:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 949 states have (on average 1.3414120126448894) internal successors, (1273), 949 states have internal predecessors, (1273), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1449 transitions. [2024-10-13 02:12:20,427 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1449 transitions. Word has length 158 [2024-10-13 02:12:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:20,427 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1449 transitions. [2024-10-13 02:12:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1449 transitions. [2024-10-13 02:12:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:20,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:20,430 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:20,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 02:12:20,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:20,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:20,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1381191144, now seen corresponding path program 1 times [2024-10-13 02:12:20,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:20,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11479192] [2024-10-13 02:12:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11479192] [2024-10-13 02:12:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11479192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:12:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301348991] [2024-10-13 02:12:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:20,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:12:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:20,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:12:20,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:12:20,706 INFO L87 Difference]: Start difference. First operand 1042 states and 1449 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:21,124 INFO L93 Difference]: Finished difference Result 1909 states and 2682 transitions. [2024-10-13 02:12:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:12:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:21,130 INFO L225 Difference]: With dead ends: 1909 [2024-10-13 02:12:21,130 INFO L226 Difference]: Without dead ends: 1382 [2024-10-13 02:12:21,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:21,134 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 221 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:21,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 661 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:12:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-13 02:12:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1132. [2024-10-13 02:12:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1039 states have (on average 1.3522617901828682) internal successors, (1405), 1039 states have internal predecessors, (1405), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1581 transitions. [2024-10-13 02:12:21,235 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1581 transitions. Word has length 158 [2024-10-13 02:12:21,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:21,235 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1581 transitions. [2024-10-13 02:12:21,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1581 transitions. [2024-10-13 02:12:21,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:21,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:21,238 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:21,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 02:12:21,238 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:21,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1002411699, now seen corresponding path program 1 times [2024-10-13 02:12:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279514311] [2024-10-13 02:12:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279514311] [2024-10-13 02:12:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279514311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:12:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047212510] [2024-10-13 02:12:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:21,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:12:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:12:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:21,331 INFO L87 Difference]: Start difference. First operand 1132 states and 1581 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:21,554 INFO L93 Difference]: Finished difference Result 2613 states and 3680 transitions. [2024-10-13 02:12:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:12:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:21,561 INFO L225 Difference]: With dead ends: 2613 [2024-10-13 02:12:21,561 INFO L226 Difference]: Without dead ends: 1482 [2024-10-13 02:12:21,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:21,564 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 114 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:21,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 265 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:12:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-10-13 02:12:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1042. [2024-10-13 02:12:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 949 states have (on average 1.3645943097997892) internal successors, (1295), 949 states have internal predecessors, (1295), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1471 transitions. [2024-10-13 02:12:21,673 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1471 transitions. Word has length 158 [2024-10-13 02:12:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:21,674 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1471 transitions. [2024-10-13 02:12:21,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1471 transitions. [2024-10-13 02:12:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:21,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:21,676 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 02:12:21,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1502684540, now seen corresponding path program 1 times [2024-10-13 02:12:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419290011] [2024-10-13 02:12:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419290011] [2024-10-13 02:12:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419290011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:22,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 02:12:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308592377] [2024-10-13 02:12:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:22,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 02:12:22,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:22,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 02:12:22,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:12:22,417 INFO L87 Difference]: Start difference. First operand 1042 states and 1471 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:23,711 INFO L93 Difference]: Finished difference Result 2703 states and 3711 transitions. [2024-10-13 02:12:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 02:12:23,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:23,722 INFO L225 Difference]: With dead ends: 2703 [2024-10-13 02:12:23,722 INFO L226 Difference]: Without dead ends: 1662 [2024-10-13 02:12:23,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-10-13 02:12:23,725 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 467 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:23,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 927 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 02:12:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-10-13 02:12:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1067. [2024-10-13 02:12:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 974 states have (on average 1.364476386036961) internal successors, (1329), 974 states have internal predecessors, (1329), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1505 transitions. [2024-10-13 02:12:23,842 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1505 transitions. Word has length 158 [2024-10-13 02:12:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:23,842 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1505 transitions. [2024-10-13 02:12:23,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1505 transitions. [2024-10-13 02:12:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:23,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:23,845 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:23,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 02:12:23,845 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:23,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1103339014, now seen corresponding path program 1 times [2024-10-13 02:12:23,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:23,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228942237] [2024-10-13 02:12:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228942237] [2024-10-13 02:12:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228942237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:24,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:12:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985346644] [2024-10-13 02:12:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:24,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:12:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:24,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:12:24,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:24,549 INFO L87 Difference]: Start difference. First operand 1067 states and 1505 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:25,665 INFO L93 Difference]: Finished difference Result 2353 states and 3320 transitions. [2024-10-13 02:12:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:12:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:25,673 INFO L225 Difference]: With dead ends: 2353 [2024-10-13 02:12:25,674 INFO L226 Difference]: Without dead ends: 1287 [2024-10-13 02:12:25,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:12:25,677 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 249 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:25,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 808 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 02:12:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-10-13 02:12:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1101. [2024-10-13 02:12:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1008 states have (on average 1.3561507936507937) internal successors, (1367), 1008 states have internal predecessors, (1367), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1543 transitions. [2024-10-13 02:12:25,792 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1543 transitions. Word has length 158 [2024-10-13 02:12:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:25,792 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1543 transitions. [2024-10-13 02:12:25,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1543 transitions. [2024-10-13 02:12:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:25,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:25,795 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 02:12:25,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2061523068, now seen corresponding path program 1 times [2024-10-13 02:12:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800627800] [2024-10-13 02:12:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800627800] [2024-10-13 02:12:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800627800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:25,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:12:25,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405051354] [2024-10-13 02:12:25,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:25,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:12:25,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:25,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:12:25,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:12:25,959 INFO L87 Difference]: Start difference. First operand 1101 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:26,432 INFO L93 Difference]: Finished difference Result 2107 states and 2980 transitions. [2024-10-13 02:12:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:12:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:26,440 INFO L225 Difference]: With dead ends: 2107 [2024-10-13 02:12:26,440 INFO L226 Difference]: Without dead ends: 1528 [2024-10-13 02:12:26,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:12:26,442 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 191 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:26,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 412 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:12:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2024-10-13 02:12:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1147. [2024-10-13 02:12:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1054 states have (on average 1.3548387096774193) internal successors, (1428), 1054 states have internal predecessors, (1428), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1604 transitions. [2024-10-13 02:12:26,565 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1604 transitions. Word has length 158 [2024-10-13 02:12:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:26,566 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1604 transitions. [2024-10-13 02:12:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1604 transitions. [2024-10-13 02:12:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 02:12:26,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:26,568 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:26,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 02:12:26,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:26,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash 132347551, now seen corresponding path program 1 times [2024-10-13 02:12:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:26,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367548502] [2024-10-13 02:12:26,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:26,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367548502] [2024-10-13 02:12:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367548502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:12:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772105989] [2024-10-13 02:12:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:26,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:12:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:12:26,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:12:26,891 INFO L87 Difference]: Start difference. First operand 1147 states and 1604 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:27,218 INFO L93 Difference]: Finished difference Result 2588 states and 3567 transitions. [2024-10-13 02:12:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:12:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-10-13 02:12:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:27,225 INFO L225 Difference]: With dead ends: 2588 [2024-10-13 02:12:27,226 INFO L226 Difference]: Without dead ends: 1442 [2024-10-13 02:12:27,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:12:27,228 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:27,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 878 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:12:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2024-10-13 02:12:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1054. [2024-10-13 02:12:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 961 states have (on average 1.3652445369406867) internal successors, (1312), 961 states have internal predecessors, (1312), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:12:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1488 transitions. [2024-10-13 02:12:27,357 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1488 transitions. Word has length 158 [2024-10-13 02:12:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:27,357 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1488 transitions. [2024-10-13 02:12:27,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1488 transitions. [2024-10-13 02:12:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 02:12:27,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:27,359 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:27,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 02:12:27,360 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:27,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1465545751, now seen corresponding path program 1 times [2024-10-13 02:12:27,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:27,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385787169] [2024-10-13 02:12:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:12:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:12:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:12:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:12:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:12:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:12:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:12:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:12:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:12:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:12:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:12:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:12:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:12:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:12:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:12:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:12:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:12:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:12:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:12:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:12:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:12:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:12:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:12:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385787169] [2024-10-13 02:12:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385787169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:27,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:12:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742538423] [2024-10-13 02:12:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:12:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:12:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:12:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:12:27,762 INFO L87 Difference]: Start difference. First operand 1054 states and 1488 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:28,055 INFO L93 Difference]: Finished difference Result 2585 states and 3626 transitions. [2024-10-13 02:12:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:12:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-10-13 02:12:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:28,063 INFO L225 Difference]: With dead ends: 2585 [2024-10-13 02:12:28,063 INFO L226 Difference]: Without dead ends: 1532 [2024-10-13 02:12:28,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:12:28,065 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 135 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:28,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 473 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:12:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-13 02:12:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1096. [2024-10-13 02:12:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 980 states have (on average 1.3581632653061224) internal successors, (1331), 980 states have internal predecessors, (1331), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-13 02:12:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1551 transitions. [2024-10-13 02:12:28,289 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1551 transitions. Word has length 159 [2024-10-13 02:12:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:28,289 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1551 transitions. [2024-10-13 02:12:28,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1551 transitions. [2024-10-13 02:12:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 02:12:28,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:28,292 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:28,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 02:12:28,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:28,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash 427892267, now seen corresponding path program 1 times [2024-10-13 02:12:28,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:12:28,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964588002] [2024-10-13 02:12:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:12:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:12:28,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:12:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:12:28,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:12:28,476 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:12:28,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:12:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 02:12:28,483 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:28,600 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:12:28,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:12:28 BoogieIcfgContainer [2024-10-13 02:12:28,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:12:28,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:12:28,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:12:28,604 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:12:28,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:12:05" (3/4) ... [2024-10-13 02:12:28,607 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:12:28,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:12:28,608 INFO L158 Benchmark]: Toolchain (without parser) took 24185.93ms. Allocated memory was 159.4MB in the beginning and 664.8MB in the end (delta: 505.4MB). Free memory was 104.7MB in the beginning and 464.9MB in the end (delta: -360.1MB). Peak memory consumption was 146.6MB. Max. memory is 16.1GB. [2024-10-13 02:12:28,608 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:12:28,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.69ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 87.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:12:28,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.87ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 82.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:12:28,612 INFO L158 Benchmark]: Boogie Preprocessor took 102.39ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 75.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:12:28,612 INFO L158 Benchmark]: RCFGBuilder took 802.79ms. Allocated memory is still 159.4MB. Free memory was 75.4MB in the beginning and 105.5MB in the end (delta: -30.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-10-13 02:12:28,613 INFO L158 Benchmark]: TraceAbstraction took 22779.43ms. Allocated memory was 159.4MB in the beginning and 664.8MB in the end (delta: 505.4MB). Free memory was 104.7MB in the beginning and 464.9MB in the end (delta: -360.2MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2024-10-13 02:12:28,613 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 664.8MB. Free memory is still 464.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:12:28,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.69ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 87.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.87ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 82.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.39ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 75.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 802.79ms. Allocated memory is still 159.4MB. Free memory was 75.4MB in the beginning and 105.5MB in the end (delta: -30.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22779.43ms. Allocated memory was 159.4MB in the beginning and 664.8MB in the end (delta: 505.4MB). Free memory was 104.7MB in the beginning and 464.9MB in the end (delta: -360.2MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 664.8MB. Free memory is still 464.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L141] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L61] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L64] var_1_31 = var_1_13 [L65] var_1_55 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L66] COND FALSE !(\read(var_1_7)) [L69] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L71] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L74] COND FALSE !(var_1_21 > (var_1_21 + var_1_23)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L81] var_1_48 = var_1_15 [L82] var_1_32 = var_1_16 [L83] var_1_54 = var_1_18 [L84] var_1_30 = var_1_32 [L85] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L86] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L86] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L87] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L89] COND TRUE (-32 & var_1_15) > var_1_11 [L90] var_1_40 = ((((var_1_21) > (var_1_19)) ? (var_1_21) : (var_1_19))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L94] COND FALSE !(var_1_19 >= ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L101] COND TRUE var_1_19 <= (var_1_19 + var_1_18) [L102] var_1_45 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-16, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L105] COND TRUE var_1_21 < var_1_22 [L106] var_1_49 = ((var_1_50 - var_1_51) + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L110] COND TRUE var_1_11 >= var_1_30 [L111] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=256, var_1_54=505, var_1_55=64, var_1_7=0] [L113] var_1_53 = var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L114] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=64, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L114] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L115] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L123] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L124] COND TRUE ! var_1_7 [L125] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L133] EXPR var_1_30 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L133] EXPR var_1_13 | var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=8, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L133] COND TRUE (var_1_30 ^ var_1_32) < (var_1_13 | var_1_11) [L134] var_1_33 = ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L182-L183] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=-256, var_1_17=506, var_1_18=505, var_1_19=507, var_1_1=-252, var_1_21=507, var_1_22=506, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_33=254, var_1_40=507, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=254, var_1_49=-63, var_1_50=0, var_1_51=0, var_1_53=64, var_1_54=505, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 22, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4366 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4366 mSDsluCounter, 12377 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8152 mSDsCounter, 936 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6515 IncrementalHoareTripleChecker+Invalid, 7451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 936 mSolverCounterUnsat, 4225 mSDtfsCounter, 6515 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1146 GetRequests, 1021 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1147occurred in iteration=19, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 6382 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 3448 NumberOfCodeBlocks, 3448 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3268 ConstructedInterpolants, 0 QuantifiedInterpolants, 9714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 19404/19404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:12:28,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:12:30,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:12:30,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:12:30,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:12:30,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:12:31,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:12:31,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:12:31,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:12:31,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:12:31,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:12:31,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:12:31,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:12:31,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:12:31,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:12:31,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:12:31,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:12:31,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:12:31,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:12:31,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:12:31,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:12:31,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:12:31,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:12:31,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:12:31,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:12:31,043 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:12:31,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:12:31,044 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:12:31,044 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:12:31,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:12:31,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:12:31,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:12:31,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:12:31,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:12:31,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:12:31,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:12:31,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:12:31,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:12:31,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:12:31,049 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:12:31,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:12:31,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:12:31,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:12:31,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:12:31,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:12:31,051 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:12:31,051 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2024-10-13 02:12:31,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:12:31,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:12:31,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:12:31,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:12:31,423 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:12:31,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-10-13 02:12:33,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:12:33,262 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:12:33,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-10-13 02:12:33,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/377ebb893/ab001c141a8e438aba51c980941cdd67/FLAG660b081e6 [2024-10-13 02:12:33,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/377ebb893/ab001c141a8e438aba51c980941cdd67 [2024-10-13 02:12:33,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:12:33,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:12:33,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:12:33,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:12:33,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:12:33,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24567304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33, skipping insertion in model container [2024-10-13 02:12:33,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:12:33,540 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-10-13 02:12:33,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:12:33,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:12:33,660 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i[919,932] [2024-10-13 02:12:33,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:12:33,729 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:12:33,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33 WrapperNode [2024-10-13 02:12:33,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:12:33,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:12:33,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:12:33,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:12:33,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,792 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-13 02:12:33,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:12:33,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:12:33,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:12:33,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:12:33,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,827 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:12:33,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:12:33,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:12:33,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:12:33,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:12:33,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (1/1) ... [2024-10-13 02:12:33,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:12:33,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:12:33,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:12:33,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:12:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:12:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:12:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:12:33,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:12:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:12:33,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:12:34,033 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:12:34,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:12:39,726 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:12:39,726 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:12:39,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:12:39,787 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:12:39,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:12:39 BoogieIcfgContainer [2024-10-13 02:12:39,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:12:39,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:12:39,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:12:39,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:12:39,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:12:33" (1/3) ... [2024-10-13 02:12:39,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5e9e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:12:39, skipping insertion in model container [2024-10-13 02:12:39,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:12:33" (2/3) ... [2024-10-13 02:12:39,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5e9e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:12:39, skipping insertion in model container [2024-10-13 02:12:39,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:12:39" (3/3) ... [2024-10-13 02:12:39,800 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2024-10-13 02:12:39,816 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:12:39,817 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:12:39,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:12:39,891 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79355b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:12:39,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:12:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 02:12:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:12:39,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:39,909 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:39,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:39,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1771965971, now seen corresponding path program 1 times [2024-10-13 02:12:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:12:39,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321520791] [2024-10-13 02:12:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:39,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:12:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:12:39,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:12:39,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:12:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:40,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:12:40,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:12:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 02:12:40,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:12:40,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:12:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321520791] [2024-10-13 02:12:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321520791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:12:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606631548] [2024-10-13 02:12:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:40,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:12:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:12:40,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:12:40,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:12:40,519 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 02:12:42,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:12:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:42,800 INFO L93 Difference]: Finished difference Result 139 states and 246 transitions. [2024-10-13 02:12:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:12:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2024-10-13 02:12:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:42,832 INFO L225 Difference]: With dead ends: 139 [2024-10-13 02:12:42,832 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 02:12:42,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:12:42,838 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:42,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 02:12:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 02:12:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 02:12:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 02:12:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2024-10-13 02:12:42,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 146 [2024-10-13 02:12:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:42,883 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 108 transitions. [2024-10-13 02:12:42,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 02:12:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2024-10-13 02:12:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:12:42,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:42,888 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:42,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:12:43,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:12:43,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -212665697, now seen corresponding path program 1 times [2024-10-13 02:12:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:12:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461187499] [2024-10-13 02:12:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:43,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:12:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:12:43,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:12:43,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:12:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:43,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:12:43,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:12:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:45,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:12:45,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:12:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461187499] [2024-10-13 02:12:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461187499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:45,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:12:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120413351] [2024-10-13 02:12:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:45,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:12:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:12:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:12:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:12:45,795 INFO L87 Difference]: Start difference. First operand 69 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:48,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:12:52,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:12:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:12:52,606 INFO L93 Difference]: Finished difference Result 206 states and 323 transitions. [2024-10-13 02:12:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:12:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-10-13 02:12:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:12:52,637 INFO L225 Difference]: With dead ends: 206 [2024-10-13 02:12:52,639 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 02:12:52,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:12:52,641 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 92 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:12:52,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 350 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-13 02:12:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 02:12:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2024-10-13 02:12:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:12:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 171 transitions. [2024-10-13 02:12:52,675 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 171 transitions. Word has length 146 [2024-10-13 02:12:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:12:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 171 transitions. [2024-10-13 02:12:52,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 171 transitions. [2024-10-13 02:12:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:12:52,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:12:52,678 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:12:52,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 02:12:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:12:52,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:12:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:12:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1030314147, now seen corresponding path program 1 times [2024-10-13 02:12:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:12:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736533820] [2024-10-13 02:12:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:12:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:12:52,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:12:52,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:12:52,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:12:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:12:53,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:12:53,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:12:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:12:53,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:12:53,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:12:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736533820] [2024-10-13 02:12:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736533820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:12:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:12:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:12:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147418791] [2024-10-13 02:12:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:12:53,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:12:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:12:53,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:12:53,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:12:53,335 INFO L87 Difference]: Start difference. First operand 111 states and 171 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:12:56,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:13:00,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:13:04,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:13:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:04,615 INFO L93 Difference]: Finished difference Result 203 states and 317 transitions. [2024-10-13 02:13:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:13:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-10-13 02:13:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:04,645 INFO L225 Difference]: With dead ends: 203 [2024-10-13 02:13:04,645 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 02:13:04,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:13:04,647 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:04,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 197 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2024-10-13 02:13:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 02:13:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2024-10-13 02:13:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:13:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2024-10-13 02:13:04,665 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 146 [2024-10-13 02:13:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:04,666 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2024-10-13 02:13:04,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:13:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2024-10-13 02:13:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:13:04,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:04,671 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:13:04,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 02:13:04,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:13:04,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:04,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1676305247, now seen corresponding path program 1 times [2024-10-13 02:13:04,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:13:04,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123334599] [2024-10-13 02:13:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:13:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:13:04,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:13:04,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:13:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:05,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:13:05,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:13:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 02:13:06,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:13:06,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:13:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123334599] [2024-10-13 02:13:06,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123334599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:13:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:13:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:13:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576699058] [2024-10-13 02:13:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:13:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:13:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:13:06,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:13:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:13:06,461 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:13:11,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:13:14,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:13:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:13:14,615 INFO L93 Difference]: Finished difference Result 391 states and 616 transitions. [2024-10-13 02:13:14,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:13:14,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-10-13 02:13:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:13:14,619 INFO L225 Difference]: With dead ends: 391 [2024-10-13 02:13:14,619 INFO L226 Difference]: Without dead ends: 306 [2024-10-13 02:13:14,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:13:14,621 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 299 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:13:14,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 314 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-10-13 02:13:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-13 02:13:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 225. [2024-10-13 02:13:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:13:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 358 transitions. [2024-10-13 02:13:14,679 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 358 transitions. Word has length 146 [2024-10-13 02:13:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:13:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 358 transitions. [2024-10-13 02:13:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 02:13:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 358 transitions. [2024-10-13 02:13:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 02:13:14,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:13:14,686 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:13:14,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 02:13:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:13:14,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:13:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:13:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1676245665, now seen corresponding path program 1 times [2024-10-13 02:13:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:13:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211176787] [2024-10-13 02:13:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:13:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:13:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:13:14,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:13:14,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 02:13:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:13:15,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 02:13:15,274 INFO L278 TraceCheckSpWp]: Computing forward predicates...