./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-cn_file-40.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-cn_file-40.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 c582d19db83cd7211158e81ede71093cb65293c4fbd970a89ad34dd4e53252c2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:20:29,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:20:29,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:20:29,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:20:29,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:20:29,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:20:29,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:20:29,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:20:29,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:20:29,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:20:29,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:20:29,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:20:29,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:20:29,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:20:29,174 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:20:29,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:20:29,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:20:29,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:20:29,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:20:29,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:20:29,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:20:29,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:20:29,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:20:29,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:20:29,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:20:29,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:20:29,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:20:29,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:20:29,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:20:29,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:20:29,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:20:29,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:20:29,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:20:29,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:20:29,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:20:29,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:20:29,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:20:29,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:20:29,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:20:29,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:20:29,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:20:29,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:20:29,181 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 -> c582d19db83cd7211158e81ede71093cb65293c4fbd970a89ad34dd4e53252c2 [2024-10-13 02:20:29,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:20:29,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:20:29,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:20:29,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:20:29,479 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:20:29,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-40.i [2024-10-13 02:20:31,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:20:31,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:20:31,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-40.i [2024-10-13 02:20:31,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99daaa5cd/90a4766e77054c78897a042b903d303f/FLAGa037b3ab6 [2024-10-13 02:20:31,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99daaa5cd/90a4766e77054c78897a042b903d303f [2024-10-13 02:20:31,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:20:31,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:20:31,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:20:31,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:20:31,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:20:31,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f50b988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31, skipping insertion in model container [2024-10-13 02:20:31,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:20:31,471 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-cn_file-40.i[919,932] [2024-10-13 02:20:31,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:20:31,555 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:20:31,567 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-cn_file-40.i[919,932] [2024-10-13 02:20:31,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:20:31,634 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:20:31,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31 WrapperNode [2024-10-13 02:20:31,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:20:31,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:20:31,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:20:31,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:20:31,644 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:20:31" (1/1) ... [2024-10-13 02:20:31,663 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:20:31" (1/1) ... [2024-10-13 02:20:31,726 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-10-13 02:20:31,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:20:31,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:20:31,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:20:31,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:20:31,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,767 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:20:31,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:20:31,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:20:31,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:20:31,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:20:31,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (1/1) ... [2024-10-13 02:20:31,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:20:31,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:20:31,850 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:20:31,885 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:20:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:20:31,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:20:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:20:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:20:31,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:20:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:20:32,085 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:20:32,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:20:32,528 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:20:32,528 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:20:32,600 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:20:32,602 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:20:32,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:20:32 BoogieIcfgContainer [2024-10-13 02:20:32,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:20:32,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:20:32,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:20:32,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:20:32,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:20:31" (1/3) ... [2024-10-13 02:20:32,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279099b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:20:32, skipping insertion in model container [2024-10-13 02:20:32,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:31" (2/3) ... [2024-10-13 02:20:32,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279099b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:20:32, skipping insertion in model container [2024-10-13 02:20:32,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:20:32" (3/3) ... [2024-10-13 02:20:32,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-40.i [2024-10-13 02:20:32,632 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:20:32,632 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:20:32,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:20:32,703 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;@5582768a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:20:32,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:20:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 02:20:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:20:32,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:32,726 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1775477747, now seen corresponding path program 1 times [2024-10-13 02:20:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052990180] [2024-10-13 02:20:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052990180] [2024-10-13 02:20:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052990180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:20:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767801253] [2024-10-13 02:20:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:33,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:20:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:20:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:20:33,329 INFO L87 Difference]: Start difference. First operand has 81 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 02:20:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:33,390 INFO L93 Difference]: Finished difference Result 159 states and 282 transitions. [2024-10-13 02:20:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:20:33,398 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-10-13 02:20:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:33,406 INFO L225 Difference]: With dead ends: 159 [2024-10-13 02:20:33,407 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 02:20:33,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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:20:33,418 INFO L432 NwaCegarLoop]: 120 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, 120 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:20:33,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:20:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 02:20:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 02:20:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 02:20:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2024-10-13 02:20:33,478 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 170 [2024-10-13 02:20:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:33,479 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2024-10-13 02:20:33,479 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 02:20:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2024-10-13 02:20:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:20:33,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:33,484 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:20:33,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 887717989, now seen corresponding path program 1 times [2024-10-13 02:20:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990524915] [2024-10-13 02:20:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990524915] [2024-10-13 02:20:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990524915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:34,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:20:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760745699] [2024-10-13 02:20:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:34,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:20:34,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:34,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:20:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:20:34,347 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:34,611 INFO L93 Difference]: Finished difference Result 235 states and 367 transitions. [2024-10-13 02:20:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:20:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-13 02:20:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:34,617 INFO L225 Difference]: With dead ends: 235 [2024-10-13 02:20:34,620 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 02:20:34,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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:20:34,625 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 199 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:34,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 283 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:20:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 02:20:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-10-13 02:20:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 02:20:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 243 transitions. [2024-10-13 02:20:34,678 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 243 transitions. Word has length 171 [2024-10-13 02:20:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 243 transitions. [2024-10-13 02:20:34,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2024-10-13 02:20:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:20:34,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:34,687 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:20:34,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:34,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash 753704483, now seen corresponding path program 1 times [2024-10-13 02:20:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:34,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377915765] [2024-10-13 02:20:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377915765] [2024-10-13 02:20:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377915765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:34,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:34,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:20:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219042367] [2024-10-13 02:20:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:20:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:20:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:20:34,896 INFO L87 Difference]: Start difference. First operand 155 states and 243 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:34,972 INFO L93 Difference]: Finished difference Result 371 states and 575 transitions. [2024-10-13 02:20:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:20:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-13 02:20:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:34,976 INFO L225 Difference]: With dead ends: 371 [2024-10-13 02:20:34,976 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 02:20:34,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:20:34,978 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 83 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:34,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 239 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:20:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 02:20:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2024-10-13 02:20:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 142 states have internal predecessors, (191), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:20:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2024-10-13 02:20:35,029 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 171 [2024-10-13 02:20:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:35,034 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2024-10-13 02:20:35,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2024-10-13 02:20:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:20:35,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:35,040 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:35,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:20:35,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:35,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -512537433, now seen corresponding path program 1 times [2024-10-13 02:20:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399169066] [2024-10-13 02:20:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:35,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399169066] [2024-10-13 02:20:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399169066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:35,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:20:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507567263] [2024-10-13 02:20:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:35,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:20:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:20:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:20:35,463 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:35,563 INFO L93 Difference]: Finished difference Result 509 states and 776 transitions. [2024-10-13 02:20:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:20:35,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-13 02:20:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:35,574 INFO L225 Difference]: With dead ends: 509 [2024-10-13 02:20:35,575 INFO L226 Difference]: Without dead ends: 296 [2024-10-13 02:20:35,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:20:35,577 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:35,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 269 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:20:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-13 02:20:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2024-10-13 02:20:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 193 states have (on average 1.3471502590673574) internal successors, (260), 194 states have internal predecessors, (260), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-13 02:20:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 448 transitions. [2024-10-13 02:20:35,638 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 448 transitions. Word has length 171 [2024-10-13 02:20:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:35,639 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 448 transitions. [2024-10-13 02:20:35,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 448 transitions. [2024-10-13 02:20:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 02:20:35,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:35,647 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:20:35,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:35,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1645999943, now seen corresponding path program 1 times [2024-10-13 02:20:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581239449] [2024-10-13 02:20:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:35,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581239449] [2024-10-13 02:20:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581239449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:35,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:20:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44748348] [2024-10-13 02:20:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:35,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:20:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:20:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:20:35,890 INFO L87 Difference]: Start difference. First operand 294 states and 448 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:35,951 INFO L93 Difference]: Finished difference Result 720 states and 1099 transitions. [2024-10-13 02:20:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:20:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-13 02:20:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:35,956 INFO L225 Difference]: With dead ends: 720 [2024-10-13 02:20:35,956 INFO L226 Difference]: Without dead ends: 427 [2024-10-13 02:20:35,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:20:35,959 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 70 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:35,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 231 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:20:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-13 02:20:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2024-10-13 02:20:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 282 states have internal predecessors, (376), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:20:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 648 transitions. [2024-10-13 02:20:36,044 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 648 transitions. Word has length 172 [2024-10-13 02:20:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 648 transitions. [2024-10-13 02:20:36,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 648 transitions. [2024-10-13 02:20:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 02:20:36,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:36,049 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:20:36,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash 686686978, now seen corresponding path program 1 times [2024-10-13 02:20:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252439184] [2024-10-13 02:20:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:36,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252439184] [2024-10-13 02:20:36,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252439184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:36,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:36,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:20:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451424029] [2024-10-13 02:20:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:36,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:20:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:36,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:20:36,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:20:36,276 INFO L87 Difference]: Start difference. First operand 425 states and 648 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:36,327 INFO L93 Difference]: Finished difference Result 849 states and 1295 transitions. [2024-10-13 02:20:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:20:36,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-13 02:20:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:36,334 INFO L225 Difference]: With dead ends: 849 [2024-10-13 02:20:36,334 INFO L226 Difference]: Without dead ends: 425 [2024-10-13 02:20:36,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:20:36,338 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:36,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:20:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-13 02:20:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-10-13 02:20:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 280 states have (on average 1.3214285714285714) internal successors, (370), 282 states have internal predecessors, (370), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:20:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 642 transitions. [2024-10-13 02:20:36,391 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 642 transitions. Word has length 173 [2024-10-13 02:20:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:36,393 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 642 transitions. [2024-10-13 02:20:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 642 transitions. [2024-10-13 02:20:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 02:20:36,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:36,399 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:20:36,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1387751556, now seen corresponding path program 1 times [2024-10-13 02:20:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813912508] [2024-10-13 02:20:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:20:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813912508] [2024-10-13 02:20:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813912508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:37,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:20:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586243500] [2024-10-13 02:20:37,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:37,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:20:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:37,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:20:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:20:37,053 INFO L87 Difference]: Start difference. First operand 425 states and 642 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:37,609 INFO L93 Difference]: Finished difference Result 1289 states and 1921 transitions. [2024-10-13 02:20:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:20:37,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-13 02:20:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:37,619 INFO L225 Difference]: With dead ends: 1289 [2024-10-13 02:20:37,620 INFO L226 Difference]: Without dead ends: 865 [2024-10-13 02:20:37,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:20:37,622 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 143 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:37,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 503 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:20:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-10-13 02:20:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 711. [2024-10-13 02:20:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 506 states have (on average 1.3438735177865613) internal successors, (680), 514 states have internal predecessors, (680), 190 states have call successors, (190), 14 states have call predecessors, (190), 14 states have return successors, (190), 182 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-13 02:20:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1060 transitions. [2024-10-13 02:20:37,714 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1060 transitions. Word has length 173 [2024-10-13 02:20:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:37,715 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1060 transitions. [2024-10-13 02:20:37,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:20:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1060 transitions. [2024-10-13 02:20:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 02:20:37,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:37,718 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:20:37,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:37,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1387811138, now seen corresponding path program 1 times [2024-10-13 02:20:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262770576] [2024-10-13 02:20:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:20:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:20:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:20:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:20:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:20:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:20:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:20:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:20:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 02:20:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:20:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 02:20:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:20:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:20:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:20:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:20:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:20:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:20:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:20:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:20:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 02:20:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:20:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 02:20:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:20:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:20:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:20:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:20:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 02:20:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:20:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262770576] [2024-10-13 02:20:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262770576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:20:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140766802] [2024-10-13 02:20:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:20:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:20:38,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:20:38,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:20:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:38,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:20:38,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:20:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-10-13 02:20:38,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:20:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 02:20:39,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140766802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:20:39,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:20:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 02:20:39,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751781248] [2024-10-13 02:20:39,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:20:39,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:20:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:20:39,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:20:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:20:39,014 INFO L87 Difference]: Start difference. First operand 711 states and 1060 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:20:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:39,303 INFO L93 Difference]: Finished difference Result 1233 states and 1785 transitions. [2024-10-13 02:20:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:20:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 173 [2024-10-13 02:20:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:39,311 INFO L225 Difference]: With dead ends: 1233 [2024-10-13 02:20:39,312 INFO L226 Difference]: Without dead ends: 523 [2024-10-13 02:20:39,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:20:39,315 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:39,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 195 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:20:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-10-13 02:20:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 483. [2024-10-13 02:20:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 326 states have (on average 1.2392638036809815) internal successors, (404), 328 states have internal predecessors, (404), 136 states have call successors, (136), 20 states have call predecessors, (136), 20 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:20:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 676 transitions. [2024-10-13 02:20:39,387 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 676 transitions. Word has length 173 [2024-10-13 02:20:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:39,388 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 676 transitions. [2024-10-13 02:20:39,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:20:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 676 transitions. [2024-10-13 02:20:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 02:20:39,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:39,390 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:20:39,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:20:39,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash 366742784, now seen corresponding path program 1 times [2024-10-13 02:20:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:20:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308231710] [2024-10-13 02:20:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:20:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:20:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137779618] [2024-10-13 02:20:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:20:39,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:20:39,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:20:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:20:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:20:40,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:20:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:20:40,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:20:40,235 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:20:40,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:20:40,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:20:40,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 02:20:40,444 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:20:40,614 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:20:40,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:20:40 BoogieIcfgContainer [2024-10-13 02:20:40,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:20:40,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:20:40,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:20:40,620 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:20:40,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:20:32" (3/4) ... [2024-10-13 02:20:40,623 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:20:40,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:20:40,625 INFO L158 Benchmark]: Toolchain (without parser) took 9360.35ms. Allocated memory was 199.2MB in the beginning and 308.3MB in the end (delta: 109.1MB). Free memory was 131.4MB in the beginning and 204.9MB in the end (delta: -73.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-10-13 02:20:40,625 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:20:40,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.22ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 114.0MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 02:20:40,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.91ms. Allocated memory is still 199.2MB. Free memory was 114.0MB in the beginning and 109.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:20:40,626 INFO L158 Benchmark]: Boogie Preprocessor took 80.96ms. Allocated memory is still 199.2MB. Free memory was 109.1MB in the beginning and 101.8MB in the end (delta: 7.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:20:40,626 INFO L158 Benchmark]: RCFGBuilder took 791.79ms. Allocated memory is still 199.2MB. Free memory was 101.5MB in the beginning and 138.0MB in the end (delta: -36.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 02:20:40,627 INFO L158 Benchmark]: TraceAbstraction took 8013.36ms. Allocated memory was 199.2MB in the beginning and 308.3MB in the end (delta: 109.1MB). Free memory was 136.7MB in the beginning and 204.9MB in the end (delta: -68.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-10-13 02:20:40,627 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 308.3MB. Free memory is still 204.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:20:40,629 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.15ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 75.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.22ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 114.0MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.91ms. Allocated memory is still 199.2MB. Free memory was 114.0MB in the beginning and 109.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.96ms. Allocated memory is still 199.2MB. Free memory was 109.1MB in the beginning and 101.8MB in the end (delta: 7.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 791.79ms. Allocated memory is still 199.2MB. Free memory was 101.5MB in the beginning and 138.0MB in the end (delta: -36.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8013.36ms. Allocated memory was 199.2MB in the beginning and 308.3MB in the end (delta: 109.1MB). Free memory was 136.7MB in the beginning and 204.9MB in the end (delta: -68.1MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 308.3MB. Free memory is still 204.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 someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 86, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_31 = 0; [L42] unsigned char var_1_32 = 0; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 50; [L45] double var_1_35 = 31.1; [L46] double var_1_36 = 127.4; [L47] unsigned long int var_1_37 = 64; [L48] signed long int var_1_38 = 8; [L49] float var_1_39 = 200.6; [L50] unsigned short int var_1_40 = 2; [L51] signed char var_1_42 = -4; [L52] double var_1_43 = 2.75; [L53] double var_1_44 = 7.6; [L54] signed char var_1_45 = 32; [L55] unsigned long int var_1_46 = 32; [L56] signed long int var_1_47 = -256; [L57] unsigned char last_1_var_1_9 = 1; [L58] float last_1_var_1_24 = 128.5; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_24 = var_1_24 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=5, var_1_9=1] [L136] var_1_8 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_9=1] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L148] var_1_20 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && 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_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && 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_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L150] var_1_28 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L153] var_1_29 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L156] var_1_31 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L159] var_1_32 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L162] var_1_33 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L164] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L165] var_1_36 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L167] var_1_39 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L170] var_1_44 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L62] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L69] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_32 || var_1_31 [L72] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L74] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=1] [L75] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L76] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L78] COND TRUE var_1_31 && var_1_32 [L79] var_1_30 = (((((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) < 0 ) ? -((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) : ((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L81] var_1_35 = var_1_36 [L82] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L83] COND TRUE (var_1_31 && var_1_32) && (var_1_30 > var_1_34) [L84] var_1_37 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L86] EXPR var_1_42 | var_1_38 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L86] COND TRUE var_1_28 > (var_1_42 | var_1_38) [L87] var_1_43 = ((((var_1_36) > ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))))))) ? (var_1_36) : ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L89] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L92] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L94] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L95] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_35)) ? ((var_1_36 / var_1_39)) : (var_1_35))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L100] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L101] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L104] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L108] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L109] var_1_46 = var_1_33 [L110] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L111] COND FALSE !(var_1_28 > var_1_30) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L116] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L117] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L118] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L122] COND TRUE var_1_27 > ((var_1_29 >> 1) + var_1_37) [L123] var_1_40 = (((((var_1_33) < 0 ) ? -(var_1_33) : (var_1_33))) + ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=61, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=-256, var_1_4=3, var_1_8=0, var_1_9=0] [L125] var_1_47 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=61, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=51, var_1_4=3, var_1_8=0, var_1_9=0] [L126] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=61, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=51, var_1_47=51, var_1_4=3, var_1_8=0, var_1_9=0] [L129] var_1_45 = var_1_28 [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=61, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=51, var_1_47=51, var_1_4=3, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-1, var_1_28=9, var_1_29=10, var_1_30=51, var_1_31=1, var_1_32=1, var_1_33=-973, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=51, var_1_38=8, var_1_40=61, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=51, var_1_47=51, var_1_4=3, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 2073 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 996 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 442 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 1077 mSDtfsCounter, 442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 799 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=711occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 203 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1710 ConstructedInterpolants, 0 QuantifiedInterpolants, 3670 SizeOfPredicates, 1 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 12847/13000 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:20:40,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-cn_file-40.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 c582d19db83cd7211158e81ede71093cb65293c4fbd970a89ad34dd4e53252c2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:20:43,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:20:43,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:20:43,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:20:43,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:20:43,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:20:43,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:20:43,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:20:43,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:20:43,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:20:43,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:20:43,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:20:43,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:20:43,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:20:43,328 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:20:43,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:20:43,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:20:43,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:20:43,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:20:43,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:20:43,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:20:43,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:20:43,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:20:43,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:20:43,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:20:43,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:20:43,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:20:43,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:20:43,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:20:43,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:20:43,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:20:43,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:20:43,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:20:43,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:20:43,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:20:43,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:20:43,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:20:43,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:20:43,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:20:43,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:20:43,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:20:43,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:20:43,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:20:43,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:20:43,338 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:20:43,338 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 -> c582d19db83cd7211158e81ede71093cb65293c4fbd970a89ad34dd4e53252c2 [2024-10-13 02:20:43,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:20:43,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:20:43,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:20:43,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:20:43,749 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:20:43,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-40.i [2024-10-13 02:20:45,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:20:45,746 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:20:45,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-40.i [2024-10-13 02:20:45,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea205b8e/32efef59e72d4586885d91a33c84b0df/FLAG61e0bf799 [2024-10-13 02:20:46,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea205b8e/32efef59e72d4586885d91a33c84b0df [2024-10-13 02:20:46,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:20:46,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:20:46,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:20:46,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:20:46,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:20:46,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d420de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46, skipping insertion in model container [2024-10-13 02:20:46,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:20:46,345 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-cn_file-40.i[919,932] [2024-10-13 02:20:46,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:20:46,474 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:20:46,490 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-cn_file-40.i[919,932] [2024-10-13 02:20:46,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:20:46,550 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:20:46,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46 WrapperNode [2024-10-13 02:20:46,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:20:46,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:20:46,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:20:46,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:20:46,561 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:20:46" (1/1) ... [2024-10-13 02:20:46,576 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:20:46" (1/1) ... [2024-10-13 02:20:46,616 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-13 02:20:46,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:20:46,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:20:46,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:20:46,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:20:46,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,665 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:20:46,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:20:46,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:20:46,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:20:46,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:20:46,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (1/1) ... [2024-10-13 02:20:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:20:46,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:20:46,766 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:20:46,770 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:20:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:20:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:20:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:20:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:20:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:20:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:20:46,915 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:20:46,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:20:56,270 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:20:56,270 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:20:56,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:20:56,376 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:20:56,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:20:56 BoogieIcfgContainer [2024-10-13 02:20:56,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:20:56,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:20:56,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:20:56,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:20:56,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:20:46" (1/3) ... [2024-10-13 02:20:56,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd7dd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:20:56, skipping insertion in model container [2024-10-13 02:20:56,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:20:46" (2/3) ... [2024-10-13 02:20:56,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd7dd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:20:56, skipping insertion in model container [2024-10-13 02:20:56,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:20:56" (3/3) ... [2024-10-13 02:20:56,389 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-40.i [2024-10-13 02:20:56,408 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:20:56,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:20:56,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:20:56,497 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;@76c3e1a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:20:56,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:20:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 02:20:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 02:20:56,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:56,518 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 59287528, now seen corresponding path program 1 times [2024-10-13 02:20:56,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:20:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513445937] [2024-10-13 02:20:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:56,536 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:20:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:20:56,539 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:20:56,593 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:20:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:57,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:20:57,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:20:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-13 02:20:57,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:20:57,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:20:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513445937] [2024-10-13 02:20:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513445937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:20:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:20:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:20:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083316604] [2024-10-13 02:20:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:20:57,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:20:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:20:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:20:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:20:57,673 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 02:20:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:20:57,897 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2024-10-13 02:20:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:20:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-10-13 02:20:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:20:57,923 INFO L225 Difference]: With dead ends: 153 [2024-10-13 02:20:57,923 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 02:20:57,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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:20:57,931 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:20:57,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:20:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 02:20:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 02:20:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 02:20:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2024-10-13 02:20:57,981 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 169 [2024-10-13 02:20:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:20:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2024-10-13 02:20:57,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 02:20:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2024-10-13 02:20:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:20:57,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:20:57,985 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,011 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:20:58,186 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:20:58,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:20:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:20:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash 844151894, now seen corresponding path program 1 times [2024-10-13 02:20:58,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:20:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896856294] [2024-10-13 02:20:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:20:58,189 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:20:58,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:20:58,192 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:20:58,193 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:20:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:20:59,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:20:59,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:21:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-10-13 02:21:01,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:21:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 02:21:04,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:21:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896856294] [2024-10-13 02:21:04,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896856294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:21:04,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:21:04,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 02:21:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279811965] [2024-10-13 02:21:04,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:21:04,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:21:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:21:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:21:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:21:04,167 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:21:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:21:09,333 INFO L93 Difference]: Finished difference Result 238 states and 358 transitions. [2024-10-13 02:21:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 02:21:09,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 170 [2024-10-13 02:21:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:21:09,341 INFO L225 Difference]: With dead ends: 238 [2024-10-13 02:21:09,341 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 02:21:09,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-13 02:21:09,343 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 225 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:21:09,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 341 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 02:21:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 02:21:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 78. [2024-10-13 02:21:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 02:21:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2024-10-13 02:21:09,373 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 170 [2024-10-13 02:21:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:21:09,374 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 115 transitions. [2024-10-13 02:21:09,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:21:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2024-10-13 02:21:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:21:09,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:21:09,380 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,411 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 02:21:09,580 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:21:09,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:21:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:21:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash -176916460, now seen corresponding path program 1 times [2024-10-13 02:21:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:21:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156511408] [2024-10-13 02:21:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:21:09,583 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:21:09,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:21:09,585 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:21:09,587 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:21:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:21:10,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:21:10,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:21:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:21:10,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:21:10,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:21:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156511408] [2024-10-13 02:21:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156511408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:21:10,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:21:10,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:21:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006829493] [2024-10-13 02:21:10,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:21:10,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:21:10,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:21:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:21:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:21:10,598 INFO L87 Difference]: Start difference. First operand 78 states and 115 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:21:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:21:10,875 INFO L93 Difference]: Finished difference Result 155 states and 229 transitions. [2024-10-13 02:21:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:21:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-13 02:21:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:21:10,889 INFO L225 Difference]: With dead ends: 155 [2024-10-13 02:21:10,889 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 02:21:10,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 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:21:10,891 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:21:10,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:21:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 02:21:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 02:21:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 02:21:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-10-13 02:21:10,916 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 170 [2024-10-13 02:21:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:21:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-10-13 02:21:10,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:21:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-10-13 02:21:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:21:10,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:21:10,920 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,949 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 02:21:11,123 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:21:11,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:21:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:21:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 524148118, now seen corresponding path program 1 times [2024-10-13 02:21:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:21:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854385482] [2024-10-13 02:21:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:21:11,126 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:21:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:21:11,127 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:21:11,128 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:21:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:21:12,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:21:12,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:21:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 02:21:13,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:21:13,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:21:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854385482] [2024-10-13 02:21:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854385482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:21:13,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:21:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:21:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355332337] [2024-10-13 02:21:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:21:13,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:21:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:21:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:21:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:21:13,043 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:21:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:21:15,336 INFO L93 Difference]: Finished difference Result 271 states and 391 transitions. [2024-10-13 02:21:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 02:21:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-13 02:21:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:21:15,343 INFO L225 Difference]: With dead ends: 271 [2024-10-13 02:21:15,343 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 02:21:15,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:21:15,347 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 208 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:21:15,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 359 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 02:21:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 02:21:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 133. [2024-10-13 02:21:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 76 states have internal predecessors, (89), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 02:21:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 193 transitions. [2024-10-13 02:21:15,388 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 193 transitions. Word has length 170 [2024-10-13 02:21:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:21:15,388 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 193 transitions. [2024-10-13 02:21:15,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 02:21:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 193 transitions. [2024-10-13 02:21:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:21:15,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:21:15,391 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:15,419 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 02:21:15,592 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:21:15,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:21:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:21:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash 524207700, now seen corresponding path program 1 times [2024-10-13 02:21:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:21:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315321190] [2024-10-13 02:21:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:21:15,594 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:21:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:21:15,597 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:21:15,599 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:21:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:21:16,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 02:21:16,568 INFO L278 TraceCheckSpWp]: Computing forward predicates...