./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.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 e19f7b0ead5c5707dd6e1eb8b79a6b9334a96eb1153ddcab780380a2e9a053e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:21:11,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:21:11,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:21:11,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:21:11,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:21:11,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:21:11,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:21:11,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:21:11,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:21:11,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:21:11,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:21:11,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:21:11,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:21:11,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:21:11,308 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:21:11,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:21:11,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:21:11,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:21:11,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:21:11,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:21:11,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:21:11,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:21:11,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:21:11,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:21:11,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:21:11,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:21:11,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:21:11,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:21:11,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:21:11,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:21:11,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:21:11,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:21:11,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:21:11,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:21:11,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:21:11,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:21:11,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:21:11,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:21:11,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:21:11,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:21:11,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:21:11,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:21:11,317 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 -> e19f7b0ead5c5707dd6e1eb8b79a6b9334a96eb1153ddcab780380a2e9a053e6 [2024-11-12 03:21:11,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:21:11,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:21:11,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:21:11,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:21:11,563 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:21:11,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i [2024-11-12 03:21:12,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:21:13,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:21:13,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i [2024-11-12 03:21:13,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b270ff417/4d4b30da9dfa4e22abefa4fb56e0643c/FLAGce0533a27 [2024-11-12 03:21:13,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b270ff417/4d4b30da9dfa4e22abefa4fb56e0643c [2024-11-12 03:21:13,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:21:13,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:21:13,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:21:13,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:21:13,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:21:13,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f521007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13, skipping insertion in model container [2024-11-12 03:21:13,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:21:13,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i[919,932] [2024-11-12 03:21:13,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:21:13,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:21:13,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i[919,932] [2024-11-12 03:21:13,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:21:13,818 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:21:13,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13 WrapperNode [2024-11-12 03:21:13,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:21:13,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:21:13,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:21:13,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:21:13,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,892 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-12 03:21:13,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:21:13,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:21:13,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:21:13,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:21:13,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,932 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-11-12 03:21:13,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:21:13,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:21:13,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:21:13,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:21:13,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (1/1) ... [2024-11-12 03:21:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:21:13,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:21:13,993 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-11-12 03:21:13,996 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-11-12 03:21:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:21:14,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:21:14,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:21:14,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:21:14,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:21:14,131 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:21:14,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:21:14,528 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 03:21:14,529 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:21:14,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:21:14,548 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:21:14,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:21:14 BoogieIcfgContainer [2024-11-12 03:21:14,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:21:14,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:21:14,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:21:14,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:21:14,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:21:13" (1/3) ... [2024-11-12 03:21:14,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e987487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:21:14, skipping insertion in model container [2024-11-12 03:21:14,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:13" (2/3) ... [2024-11-12 03:21:14,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e987487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:21:14, skipping insertion in model container [2024-11-12 03:21:14,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:21:14" (3/3) ... [2024-11-12 03:21:14,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i [2024-11-12 03:21:14,568 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:21:14,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:21:14,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:21:14,629 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;@689f7e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:21:14,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:21:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 03:21:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:21:14,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:14,645 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:14,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:14,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -799766037, now seen corresponding path program 1 times [2024-11-12 03:21:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449293366] [2024-11-12 03:21:14,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:21:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:21:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:21:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:21:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:21:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:21:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:21:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:21:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:21:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:21:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:21:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:21:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:21:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:21:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:21:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:21:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:21:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:21:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:21:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:21:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:21:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:21:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:21:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:21:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 03:21:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:21:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 03:21:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 03:21:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:21:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449293366] [2024-11-12 03:21:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449293366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:15,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:15,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:21:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361870404] [2024-11-12 03:21:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:15,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:21:15,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:21:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:21:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:21:15,133 INFO L87 Difference]: Start difference. First operand has 102 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 03:21:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:15,165 INFO L93 Difference]: Finished difference Result 196 states and 332 transitions. [2024-11-12 03:21:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:21:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 190 [2024-11-12 03:21:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:15,173 INFO L225 Difference]: With dead ends: 196 [2024-11-12 03:21:15,173 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 03:21:15,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-11-12 03:21:15,179 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:15,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:21:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 03:21:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 03:21:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 03:21:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2024-11-12 03:21:15,227 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 190 [2024-11-12 03:21:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:15,227 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2024-11-12 03:21:15,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 03:21:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2024-11-12 03:21:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 03:21:15,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:15,234 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:15,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:21:15,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:15,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1987418355, now seen corresponding path program 1 times [2024-11-12 03:21:15,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:15,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559668728] [2024-11-12 03:21:15,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:21:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:21:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:21:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:21:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:21:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:21:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:21:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:21:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:21:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:21:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:21:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:21:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:21:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:21:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:21:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:21:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:21:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:21:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:21:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:21:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:21:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:21:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:21:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:21:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 03:21:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:21:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 03:21:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 03:21:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:15,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:21:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559668728] [2024-11-12 03:21:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559668728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:15,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:21:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975262844] [2024-11-12 03:21:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:15,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:21:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:21:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:21:15,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:21:15,779 INFO L87 Difference]: Start difference. First operand 97 states and 146 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:16,030 INFO L93 Difference]: Finished difference Result 321 states and 485 transitions. [2024-11-12 03:21:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:21:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-12 03:21:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:16,033 INFO L225 Difference]: With dead ends: 321 [2024-11-12 03:21:16,034 INFO L226 Difference]: Without dead ends: 227 [2024-11-12 03:21:16,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:21:16,035 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 150 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:16,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 580 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:21:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-12 03:21:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2024-11-12 03:21:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 130 states have internal predecessors, (175), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 03:21:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 287 transitions. [2024-11-12 03:21:16,076 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 287 transitions. Word has length 190 [2024-11-12 03:21:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:16,077 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 287 transitions. [2024-11-12 03:21:16,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 287 transitions. [2024-11-12 03:21:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:21:16,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:16,083 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:21:16,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash -312224578, now seen corresponding path program 1 times [2024-11-12 03:21:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755848531] [2024-11-12 03:21:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:21:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:21:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:21:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:21:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:21:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:21:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:21:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:21:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:21:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:21:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:21:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:21:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:21:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:21:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:21:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:21:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:21:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:21:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:21:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:21:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:21:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:21:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:21:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:21:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 03:21:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:21:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 03:21:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 03:21:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:21:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755848531] [2024-11-12 03:21:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755848531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:16,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:21:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432712479] [2024-11-12 03:21:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:16,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:21:16,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:21:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:21:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:21:16,380 INFO L87 Difference]: Start difference. First operand 189 states and 287 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:16,662 INFO L93 Difference]: Finished difference Result 650 states and 986 transitions. [2024-11-12 03:21:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:21:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-12 03:21:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:16,671 INFO L225 Difference]: With dead ends: 650 [2024-11-12 03:21:16,672 INFO L226 Difference]: Without dead ends: 464 [2024-11-12 03:21:16,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-11-12 03:21:16,675 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 195 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:16,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 519 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:21:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-12 03:21:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 334. [2024-11-12 03:21:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 259 states have (on average 1.420849420849421) internal successors, (368), 261 states have internal predecessors, (368), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 03:21:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 508 transitions. [2024-11-12 03:21:16,738 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 508 transitions. Word has length 191 [2024-11-12 03:21:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:16,739 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 508 transitions. [2024-11-12 03:21:16,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 508 transitions. [2024-11-12 03:21:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:21:16,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:16,742 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:16,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:21:16,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash -93369860, now seen corresponding path program 1 times [2024-11-12 03:21:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524403551] [2024-11-12 03:21:16,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:21:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:21:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:21:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:21:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:21:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:21:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:21:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:21:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:21:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:21:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:21:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:21:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:21:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:21:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:21:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:21:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:21:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:21:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:21:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:21:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:21:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:21:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:21:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:21:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 03:21:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:21:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 03:21:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 03:21:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:21:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524403551] [2024-11-12 03:21:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524403551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:21:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726319076] [2024-11-12 03:21:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:17,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:21:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:21:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:21:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:21:17,088 INFO L87 Difference]: Start difference. First operand 334 states and 508 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:17,233 INFO L93 Difference]: Finished difference Result 1195 states and 1823 transitions. [2024-11-12 03:21:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:21:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-12 03:21:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:17,244 INFO L225 Difference]: With dead ends: 1195 [2024-11-12 03:21:17,244 INFO L226 Difference]: Without dead ends: 864 [2024-11-12 03:21:17,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:21:17,248 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 177 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:17,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 483 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:21:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-12 03:21:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 663. [2024-11-12 03:21:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 514 states have (on average 1.4202334630350195) internal successors, (730), 518 states have internal predecessors, (730), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 03:21:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1010 transitions. [2024-11-12 03:21:17,321 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1010 transitions. Word has length 191 [2024-11-12 03:21:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:17,324 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1010 transitions. [2024-11-12 03:21:17,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1010 transitions. [2024-11-12 03:21:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:21:17,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:17,326 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:17,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:21:17,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:17,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1292833534, now seen corresponding path program 1 times [2024-11-12 03:21:17,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:17,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907309704] [2024-11-12 03:21:17,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:21:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:21:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:21:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:21:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:21:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:21:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:21:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:21:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:21:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:21:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:21:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:21:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:21:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:21:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:21:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:21:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:21:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:21:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:21:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:21:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:21:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:21:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:21:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:21:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 03:21:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:21:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 03:21:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 03:21:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:21:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907309704] [2024-11-12 03:21:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907309704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:21:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067413263] [2024-11-12 03:21:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:21:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:21:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:21:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:21:17,622 INFO L87 Difference]: Start difference. First operand 663 states and 1010 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:17,897 INFO L93 Difference]: Finished difference Result 1246 states and 1857 transitions. [2024-11-12 03:21:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:21:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-12 03:21:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:17,903 INFO L225 Difference]: With dead ends: 1246 [2024-11-12 03:21:17,903 INFO L226 Difference]: Without dead ends: 915 [2024-11-12 03:21:17,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:21:17,905 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 183 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:17,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 510 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:21:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-11-12 03:21:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 663. [2024-11-12 03:21:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 514 states have (on average 1.4124513618677044) internal successors, (726), 518 states have internal predecessors, (726), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 03:21:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1006 transitions. [2024-11-12 03:21:17,978 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1006 transitions. Word has length 191 [2024-11-12 03:21:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:17,978 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1006 transitions. [2024-11-12 03:21:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1006 transitions. [2024-11-12 03:21:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:21:17,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:17,982 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:21:17,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:17,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 271765180, now seen corresponding path program 1 times [2024-11-12 03:21:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:17,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49402854] [2024-11-12 03:21:17,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:21:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:21:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:21:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:21:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:21:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:21:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:21:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:21:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:21:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:21:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:21:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:21:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:21:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:21:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:21:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:21:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:21:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:21:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:21:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:21:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:21:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:21:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:21:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:21:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 03:21:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 03:21:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 03:21:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 03:21:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 03:21:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:21:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49402854] [2024-11-12 03:21:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49402854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:21:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152219046] [2024-11-12 03:21:18,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:21:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:21:18,209 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-11-12 03:21:18,210 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-11-12 03:21:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:18,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:21:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:21:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-12 03:21:18,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:21:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 03:21:18,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152219046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:21:18,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:21:18,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 03:21:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707254484] [2024-11-12 03:21:18,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:21:18,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:21:18,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:21:18,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:21:18,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:21:18,685 INFO L87 Difference]: Start difference. First operand 663 states and 1006 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-12 03:21:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:18,894 INFO L93 Difference]: Finished difference Result 1355 states and 2037 transitions. [2024-11-12 03:21:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:21:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 191 [2024-11-12 03:21:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:18,900 INFO L225 Difference]: With dead ends: 1355 [2024-11-12 03:21:18,900 INFO L226 Difference]: Without dead ends: 695 [2024-11-12 03:21:18,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:21:18,903 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 135 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:18,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 260 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:21:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-12 03:21:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 679. [2024-11-12 03:21:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 526 states have (on average 1.3802281368821292) internal successors, (726), 530 states have internal predecessors, (726), 140 states have call successors, (140), 12 states have call predecessors, (140), 12 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-12 03:21:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1006 transitions. [2024-11-12 03:21:18,951 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1006 transitions. Word has length 191 [2024-11-12 03:21:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:18,952 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1006 transitions. [2024-11-12 03:21:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-12 03:21:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1006 transitions. [2024-11-12 03:21:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 03:21:18,955 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:18,955 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:18,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:21:19,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 03:21:19,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:19,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -537581446, now seen corresponding path program 1 times [2024-11-12 03:21:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:21:19,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867788221] [2024-11-12 03:21:19,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:21:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:21:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944130682] [2024-11-12 03:21:19,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:21:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:21:19,226 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-11-12 03:21:19,227 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-11-12 03:21:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:21:19,365 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:21:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:21:19,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:21:19,511 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:21:19,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:21:19,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 03:21:19,713 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,SelfDestructingSolverStorable6 [2024-11-12 03:21:19,717 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:21:19,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:21:19,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:21:19 BoogieIcfgContainer [2024-11-12 03:21:19,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:21:19,833 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:21:19,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:21:19,833 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:21:19,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:21:14" (3/4) ... [2024-11-12 03:21:19,836 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:21:19,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:21:19,837 INFO L158 Benchmark]: Toolchain (without parser) took 6381.32ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 126.0MB in the beginning and 182.4MB in the end (delta: -56.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-12 03:21:19,837 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:21:19,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.08ms. Allocated memory is still 161.5MB. Free memory was 125.5MB in the beginning and 108.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:21:19,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.38ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 104.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:21:19,838 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:21:19,838 INFO L158 Benchmark]: RCFGBuilder took 587.16ms. Allocated memory is still 161.5MB. Free memory was 99.8MB in the beginning and 116.7MB in the end (delta: -16.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 03:21:19,838 INFO L158 Benchmark]: TraceAbstraction took 5282.36ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 116.7MB in the beginning and 182.4MB in the end (delta: -65.7MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2024-11-12 03:21:19,839 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 249.6MB. Free memory is still 182.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:21:19,839 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.11ms. Allocated memory is still 125.8MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.08ms. Allocated memory is still 161.5MB. Free memory was 125.5MB in the beginning and 108.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.38ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 104.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 99.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 587.16ms. Allocated memory is still 161.5MB. Free memory was 99.8MB in the beginning and 116.7MB in the end (delta: -16.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5282.36ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 116.7MB in the beginning and 182.4MB in the end (delta: -65.7MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 249.6MB. Free memory is still 182.4MB. 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 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someUnaryFLOAToperation at line 128, overapproximation of someBinaryArithmeticFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] signed long int var_1_28 = -100000; [L45] signed char var_1_30 = -25; [L46] signed char var_1_33 = 32; [L47] signed char var_1_34 = -4; [L48] unsigned long int var_1_35 = 1; [L49] double var_1_39 = 7.75; [L50] float var_1_41 = 255.2; [L51] unsigned char var_1_42 = 25; [L52] unsigned char var_1_43 = 64; [L53] unsigned char var_1_44 = 1; [L54] float var_1_45 = 255.5; [L55] float var_1_46 = 10.55; [L56] signed short int last_1_var_1_12 = 2; [L57] signed long int last_1_var_1_13 = -256; [L58] double last_1_var_1_14 = 127.75; [L59] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_14 = var_1_14 [L188] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L138] var_1_3 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L139] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L141] var_1_4 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L142] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L144] var_1_5 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L145] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L146] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L146] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L149] var_1_11 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_15 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] var_1_17 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L155] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L156] var_1_18 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L157] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L158] var_1_19 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L159] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L160] var_1_20 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L161] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L162] var_1_22 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L163] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L165] var_1_24 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L172] RET assume_abort_if_not(var_1_33 >= -126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L174] var_1_34 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_34 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L175] RET assume_abort_if_not(var_1_34 >= -63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L177] var_1_43 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L180] var_1_44 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] CALL assume_abort_if_not(var_1_44 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] RET assume_abort_if_not(var_1_44 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L199] RET updateVariables() [L200] CALL step() [L63] COND FALSE !(\read(last_1_var_1_21)) [L66] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L68] var_1_41 = ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) < (var_1_20)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_20))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L69] COND TRUE var_1_18 > var_1_9 [L70] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L74] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L75] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L76] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L77] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L84] var_1_26 = var_1_18 [L85] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L86] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L89] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L89] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L90] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=164/5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L94] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L95] COND FALSE !(! var_1_3) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=200] [L102] var_1_46 = var_1_18 [L103] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L104] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=-25, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L107] COND FALSE !(var_1_18 <= var_1_9) [L112] var_1_30 = (50 + var_1_34) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L114] EXPR var_1_11 | var_1_23 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L114] COND TRUE var_1_33 < (var_1_11 | var_1_23) [L115] var_1_42 = ((((var_1_43) < (var_1_44)) ? (var_1_43) : (var_1_44))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L117] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L118] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-100000, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L123] var_1_28 = var_1_23 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L124] COND TRUE 32u >= (((((var_1_6) > (var_1_11)) ? (var_1_6) : (var_1_11))) % 16u) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L125] COND FALSE !((-5 > var_1_25) && (var_1_6 <= ((((var_1_34) > (var_1_23)) ? (var_1_34) : (var_1_23))))) [L128] var_1_39 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_17=0, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=6, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L135] var_1_45 = 2.71f VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_17=0, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=6, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_17=0, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=6, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L191-L192] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_17=0, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=6, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_17=0, var_1_18=3, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-125, var_1_24=-1, var_1_25=124, var_1_26=3, var_1_28=-125, var_1_30=0, var_1_33=-126, var_1_34=-50, var_1_35=1, var_1_39=6, var_1_3=1, var_1_41=2, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=3, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 858 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 2498 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1483 mSDsCounter, 246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 246 mSolverCounterUnsat, 1015 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=679occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 637 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1518 ConstructedInterpolants, 0 QuantifiedInterpolants, 2374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12015/12096 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-11-12 03:21:19,866 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.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 e19f7b0ead5c5707dd6e1eb8b79a6b9334a96eb1153ddcab780380a2e9a053e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:21:21,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:21:21,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:21:21,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:21:21,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:21:21,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:21:21,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:21:21,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:21:21,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:21:21,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:21:21,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:21:21,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:21:21,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:21:21,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:21:21,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:21:21,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:21:21,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:21:21,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:21:21,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:21:21,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:21:21,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:21:21,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:21:21,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:21:21,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:21:21,910 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:21:21,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:21:21,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:21:21,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:21:21,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:21:21,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:21:21,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:21:21,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:21:21,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:21:21,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:21:21,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:21:21,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:21:21,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:21:21,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:21:21,912 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:21:21,913 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:21:21,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:21:21,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:21:21,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:21:21,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:21:21,913 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 -> e19f7b0ead5c5707dd6e1eb8b79a6b9334a96eb1153ddcab780380a2e9a053e6 [2024-11-12 03:21:22,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:21:22,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:21:22,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:21:22,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:21:22,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:21:22,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i [2024-11-12 03:21:23,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:21:23,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:21:23,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i [2024-11-12 03:21:23,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe111168/e7b13d73f7ed41dc8f5e1f149c26cfc6/FLAG130e74054 [2024-11-12 03:21:24,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe111168/e7b13d73f7ed41dc8f5e1f149c26cfc6 [2024-11-12 03:21:24,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:21:24,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:21:24,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:21:24,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:21:24,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:21:24,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebae2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24, skipping insertion in model container [2024-11-12 03:21:24,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:21:24,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i[919,932] [2024-11-12 03:21:24,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:21:24,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:21:24,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i[919,932] [2024-11-12 03:21:24,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:21:24,561 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:21:24,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24 WrapperNode [2024-11-12 03:21:24,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:21:24,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:21:24,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:21:24,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:21:24,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,632 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-12 03:21:24,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:21:24,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:21:24,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:21:24,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:21:24,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,669 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-11-12 03:21:24,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:21:24,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:21:24,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:21:24,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:21:24,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (1/1) ... [2024-11-12 03:21:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:21:24,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:21:24,732 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-11-12 03:21:24,734 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-11-12 03:21:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:21:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:21:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:21:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:21:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:21:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:21:24,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:21:24,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:21:26,917 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 03:21:26,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:21:26,928 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:21:26,929 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:21:26,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:21:26 BoogieIcfgContainer [2024-11-12 03:21:26,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:21:26,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:21:26,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:21:26,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:21:26,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:21:24" (1/3) ... [2024-11-12 03:21:26,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d15d954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:21:26, skipping insertion in model container [2024-11-12 03:21:26,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:21:24" (2/3) ... [2024-11-12 03:21:26,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d15d954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:21:26, skipping insertion in model container [2024-11-12 03:21:26,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:21:26" (3/3) ... [2024-11-12 03:21:26,938 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-35.i [2024-11-12 03:21:26,951 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:21:26,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:21:27,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:21:27,013 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;@77a9a05c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:21:27,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:21:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 03:21:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 03:21:27,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:27,030 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:27,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1523812844, now seen corresponding path program 1 times [2024-11-12 03:21:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:21:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520963280] [2024-11-12 03:21:27,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:27,052 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-11-12 03:21:27,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:21:27,056 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-11-12 03:21:27,057 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-11-12 03:21:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:27,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:21:27,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:21:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-12 03:21:27,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:21:27,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:21:27,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520963280] [2024-11-12 03:21:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520963280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:21:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309855454] [2024-11-12 03:21:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:27,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:21:27,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:21:27,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:21:27,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:21:27,556 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 03:21:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:27,589 INFO L93 Difference]: Finished difference Result 170 states and 292 transitions. [2024-11-12 03:21:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:21:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-12 03:21:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:27,606 INFO L225 Difference]: With dead ends: 170 [2024-11-12 03:21:27,606 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 03:21:27,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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-11-12 03:21:27,612 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:27,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:21:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 03:21:27,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 03:21:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 03:21:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-12 03:21:27,650 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 186 [2024-11-12 03:21:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:27,651 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-12 03:21:27,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 03:21:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-12 03:21:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 03:21:27,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:27,654 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:27,668 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-11-12 03:21:27,854 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-11-12 03:21:27,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2102735310, now seen corresponding path program 1 times [2024-11-12 03:21:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:21:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6704662] [2024-11-12 03:21:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:27,857 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-11-12 03:21:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:21:27,858 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-11-12 03:21:27,859 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-11-12 03:21:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:28,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 03:21:28,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:21:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:28,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:21:28,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:21:28,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6704662] [2024-11-12 03:21:28,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6704662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:28,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:28,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:21:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953697974] [2024-11-12 03:21:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:28,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:21:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:21:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:21:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:21:28,830 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:31,036 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2024-11-12 03:21:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:21:31,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-12 03:21:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:31,055 INFO L225 Difference]: With dead ends: 276 [2024-11-12 03:21:31,058 INFO L226 Difference]: Without dead ends: 195 [2024-11-12 03:21:31,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:21:31,060 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 132 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:31,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 403 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 03:21:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-12 03:21:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2024-11-12 03:21:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 03:21:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2024-11-12 03:21:31,091 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 186 [2024-11-12 03:21:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:31,092 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2024-11-12 03:21:31,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2024-11-12 03:21:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 03:21:31,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:31,095 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:31,109 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-11-12 03:21:31,295 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-11-12 03:21:31,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:31,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2058218480, now seen corresponding path program 1 times [2024-11-12 03:21:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:21:31,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653772315] [2024-11-12 03:21:31,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:31,297 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-11-12 03:21:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:21:31,300 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-11-12 03:21:31,301 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-11-12 03:21:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:31,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 03:21:31,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:21:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:32,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:21:32,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:21:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653772315] [2024-11-12 03:21:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653772315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:21:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840145075] [2024-11-12 03:21:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:21:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:21:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:21:32,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:21:32,103 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:34,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:21:35,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:21:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:35,344 INFO L93 Difference]: Finished difference Result 527 states and 800 transitions. [2024-11-12 03:21:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:21:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-12 03:21:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:35,366 INFO L225 Difference]: With dead ends: 527 [2024-11-12 03:21:35,366 INFO L226 Difference]: Without dead ends: 367 [2024-11-12 03:21:35,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:21:35,368 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 107 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:35,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 463 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-12 03:21:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-12 03:21:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 321. [2024-11-12 03:21:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 204 states have internal predecessors, (264), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-12 03:21:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 488 transitions. [2024-11-12 03:21:35,407 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 488 transitions. Word has length 186 [2024-11-12 03:21:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:35,407 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 488 transitions. [2024-11-12 03:21:35,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 488 transitions. [2024-11-12 03:21:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 03:21:35,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:35,409 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:35,425 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-11-12 03:21:35,610 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-11-12 03:21:35,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1487906799, now seen corresponding path program 1 times [2024-11-12 03:21:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:21:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161833979] [2024-11-12 03:21:35,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:35,612 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-11-12 03:21:35,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:21:35,615 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-11-12 03:21:35,616 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-11-12 03:21:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:36,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 03:21:36,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:21:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 03:21:36,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:21:36,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:21:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161833979] [2024-11-12 03:21:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161833979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:21:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:21:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:21:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819626628] [2024-11-12 03:21:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:21:36,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:21:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:21:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:21:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:21:36,105 INFO L87 Difference]: Start difference. First operand 321 states and 488 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:21:38,643 INFO L93 Difference]: Finished difference Result 796 states and 1205 transitions. [2024-11-12 03:21:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:21:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-12 03:21:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:21:38,661 INFO L225 Difference]: With dead ends: 796 [2024-11-12 03:21:38,661 INFO L226 Difference]: Without dead ends: 715 [2024-11-12 03:21:38,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:21:38,664 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 204 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:21:38,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 428 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-12 03:21:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-12 03:21:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 401. [2024-11-12 03:21:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 270 states have internal predecessors, (352), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 124 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-12 03:21:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 604 transitions. [2024-11-12 03:21:38,731 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 604 transitions. Word has length 187 [2024-11-12 03:21:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:21:38,732 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 604 transitions. [2024-11-12 03:21:38,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 03:21:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 604 transitions. [2024-11-12 03:21:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 03:21:38,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:21:38,735 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:21:38,750 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-11-12 03:21:38,936 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-11-12 03:21:38,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:21:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:21:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash 901100785, now seen corresponding path program 1 times [2024-11-12 03:21:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:21:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806543193] [2024-11-12 03:21:38,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:21:38,942 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-11-12 03:21:38,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:21:38,945 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-11-12 03:21:38,946 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-11-12 03:21:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:21:39,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 03:21:39,374 INFO L279 TraceCheckSpWp]: Computing forward predicates...