./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.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_fillercodesize_ps-cn-25_file-0.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 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:15:05,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:15:05,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:15:05,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:15:05,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:15:05,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:15:05,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:15:05,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:15:05,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:15:05,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:15:05,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:15:05,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:15:05,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:15:05,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:15:05,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:15:05,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:15:05,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:15:05,484 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:15:05,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:15:05,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:15:05,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:15:05,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:15:05,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:15:05,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:15:05,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:15:05,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:15:05,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:15:05,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:15:05,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:15:05,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:15:05,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:15:05,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:15:05,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:15:05,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:15:05,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:15:05,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:15:05,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:15:05,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:15:05,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:15:05,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:15:05,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:15:05,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:15:05,494 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 -> 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 [2024-11-12 02:15:05,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:15:05,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:15:05,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:15:05,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:15:05,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:15:05,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-11-12 02:15:07,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:15:07,478 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:15:07,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-11-12 02:15:07,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37a94a59/903b5539bf4346ba8617a88860777a81/FLAG31eea9471 [2024-11-12 02:15:07,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37a94a59/903b5539bf4346ba8617a88860777a81 [2024-11-12 02:15:07,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:15:07,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:15:07,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:15:07,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:15:07,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:15:07,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:07" (1/1) ... [2024-11-12 02:15:07,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d9092b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:07, skipping insertion in model container [2024-11-12 02:15:07,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:07" (1/1) ... [2024-11-12 02:15:07,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:15:08,066 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_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-11-12 02:15:08,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:15:08,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:15:08,180 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_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-11-12 02:15:08,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:15:08,253 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:15:08,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08 WrapperNode [2024-11-12 02:15:08,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:15:08,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:15:08,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:15:08,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:15:08,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,306 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-12 02:15:08,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:15:08,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:15:08,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:15:08,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:15:08,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,354 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 02:15:08,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:15:08,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:15:08,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:15:08,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:15:08,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (1/1) ... [2024-11-12 02:15:08,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:15:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:15:08,424 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 02:15:08,431 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 02:15:08,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:15:08,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:15:08,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:15:08,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:15:08,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:15:08,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:15:08,568 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:15:08,569 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:15:08,882 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 02:15:08,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:15:08,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:15:08,896 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:15:08,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:08 BoogieIcfgContainer [2024-11-12 02:15:08,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:15:08,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:15:08,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:15:08,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:15:08,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:15:07" (1/3) ... [2024-11-12 02:15:08,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1119471b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:08, skipping insertion in model container [2024-11-12 02:15:08,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:08" (2/3) ... [2024-11-12 02:15:08,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1119471b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:08, skipping insertion in model container [2024-11-12 02:15:08,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:08" (3/3) ... [2024-11-12 02:15:08,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-11-12 02:15:08,919 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:15:08,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:15:08,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:15:08,977 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;@36ced638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:15:08,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:15:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 02:15:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:15:08,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:15:08,999 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:15:08,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:15:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:15:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1864201580, now seen corresponding path program 1 times [2024-11-12 02:15:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:15:09,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780482861] [2024-11-12 02:15:09,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:09,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:15:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:15:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:15:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:15:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:15:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:15:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:15:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:15:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:15:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:15:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 02:15:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:15:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:15:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:15:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:15:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:15:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:15:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:15:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:15:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:15:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:15:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:15:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:15:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 02:15:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:15:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780482861] [2024-11-12 02:15:09,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780482861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:15:09,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:15:09,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:15:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707090311] [2024-11-12 02:15:09,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:15:09,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:15:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:15:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:15:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:15:09,638 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 02:15:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:15:09,674 INFO L93 Difference]: Finished difference Result 141 states and 242 transitions. [2024-11-12 02:15:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:15:09,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2024-11-12 02:15:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:15:09,684 INFO L225 Difference]: With dead ends: 141 [2024-11-12 02:15:09,684 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 02:15:09,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:15:09,693 INFO L435 NwaCegarLoop]: 106 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, 106 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 02:15:09,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:15:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 02:15:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 02:15:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 02:15:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-12 02:15:09,732 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 148 [2024-11-12 02:15:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:15:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-12 02:15:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 02:15:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-12 02:15:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:15:09,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:15:09,736 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:15:09,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:15:09,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:15:09,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:15:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1988095880, now seen corresponding path program 1 times [2024-11-12 02:15:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:15:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107697411] [2024-11-12 02:15:09,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:15:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:15:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:15:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:15:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:15:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:15:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:15:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:15:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:15:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:15:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 02:15:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:15:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:15:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:15:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:15:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:15:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:15:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:15:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:15:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:15:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:15:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:15:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:15:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 02:15:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:15:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107697411] [2024-11-12 02:15:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107697411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:15:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:15:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:15:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082843731] [2024-11-12 02:15:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:15:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:15:10,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:15:10,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:15:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:15:10,487 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 02:15:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:15:10,753 INFO L93 Difference]: Finished difference Result 205 states and 313 transitions. [2024-11-12 02:15:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:15:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 02:15:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:15:10,757 INFO L225 Difference]: With dead ends: 205 [2024-11-12 02:15:10,757 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 02:15:10,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:15:10,759 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 69 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:15:10,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 341 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:15:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 02:15:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2024-11-12 02:15:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 02:15:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2024-11-12 02:15:10,795 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 148 [2024-11-12 02:15:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:15:10,797 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2024-11-12 02:15:10,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 02:15:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2024-11-12 02:15:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:15:10,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:15:10,800 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:15:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:15:10,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:15:10,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:15:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1401289866, now seen corresponding path program 1 times [2024-11-12 02:15:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:15:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417291400] [2024-11-12 02:15:10,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:15:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:15:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:15:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:15:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:15:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:15:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:15:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:15:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 02:15:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 02:15:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 02:15:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 02:15:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:15:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 02:15:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 02:15:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 02:15:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:15:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 02:15:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:15:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 02:15:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:15:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:15:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:15:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 02:15:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:15:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417291400] [2024-11-12 02:15:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417291400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:15:11,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:15:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:15:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65338862] [2024-11-12 02:15:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:15:11,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:15:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:15:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:15:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:15:11,333 INFO L87 Difference]: Start difference. First operand 121 states and 186 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 02:15:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:15:11,514 INFO L93 Difference]: Finished difference Result 272 states and 414 transitions. [2024-11-12 02:15:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:15:11,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 02:15:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:15:11,518 INFO L225 Difference]: With dead ends: 272 [2024-11-12 02:15:11,518 INFO L226 Difference]: Without dead ends: 202 [2024-11-12 02:15:11,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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 02:15:11,523 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 105 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:15:11,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 306 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:15:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-12 02:15:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2024-11-12 02:15:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 02:15:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2024-11-12 02:15:11,570 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 148 [2024-11-12 02:15:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:15:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2024-11-12 02:15:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 02:15:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2024-11-12 02:15:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:15:11,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:15:11,577 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:15:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:15:11,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:15:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:15:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 380221512, now seen corresponding path program 1 times [2024-11-12 02:15:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:15:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133196379] [2024-11-12 02:15:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:15:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:15:11,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273364716] [2024-11-12 02:15:11,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:15:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:15:11,687 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 02:15:11,688 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 02:15:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:15:11,915 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:15:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:15:12,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:15:12,069 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:15:12,070 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:15:12,092 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 02:15:12,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:15:12,282 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 02:15:12,419 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:15:12,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:15:12 BoogieIcfgContainer [2024-11-12 02:15:12,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:15:12,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:15:12,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:15:12,423 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:15:12,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:08" (3/4) ... [2024-11-12 02:15:12,426 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:15:12,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:15:12,428 INFO L158 Benchmark]: Toolchain (without parser) took 4594.02ms. Allocated memory was 178.3MB in the beginning and 224.4MB in the end (delta: 46.1MB). Free memory was 146.8MB in the beginning and 145.9MB in the end (delta: 822.9kB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-11-12 02:15:12,429 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 91.3MB in the beginning and 91.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:15:12,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.07ms. Allocated memory is still 178.3MB. Free memory was 146.5MB in the beginning and 134.0MB in the end (delta: 12.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-12 02:15:12,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 178.3MB. Free memory was 134.0MB in the beginning and 131.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 02:15:12,430 INFO L158 Benchmark]: Boogie Preprocessor took 77.23ms. Allocated memory is still 178.3MB. Free memory was 131.3MB in the beginning and 127.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:15:12,430 INFO L158 Benchmark]: RCFGBuilder took 509.02ms. Allocated memory is still 178.3MB. Free memory was 127.8MB in the beginning and 106.2MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 02:15:12,430 INFO L158 Benchmark]: TraceAbstraction took 3522.73ms. Allocated memory was 178.3MB in the beginning and 224.4MB in the end (delta: 46.1MB). Free memory was 105.4MB in the beginning and 145.9MB in the end (delta: -40.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-12 02:15:12,431 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 224.4MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:15:12,432 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 91.3MB in the beginning and 91.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.07ms. Allocated memory is still 178.3MB. Free memory was 146.5MB in the beginning and 134.0MB in the end (delta: 12.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 178.3MB. Free memory was 134.0MB in the beginning and 131.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.23ms. Allocated memory is still 178.3MB. Free memory was 131.3MB in the beginning and 127.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 509.02ms. Allocated memory is still 178.3MB. Free memory was 127.8MB in the beginning and 106.2MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3522.73ms. Allocated memory was 178.3MB in the beginning and 224.4MB in the end (delta: 46.1MB). Free memory was 105.4MB in the beginning and 145.9MB in the end (delta: -40.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 224.4MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryFLOATComparisonOperation at line 163, overapproximation of someUnaryDOUBLEoperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 31.2; [L38] signed short int var_1_22 = 1000; [L39] signed long int var_1_23 = 50; [L40] signed short int var_1_24 = -32; [L41] unsigned char var_1_25 = 8; [L42] double var_1_26 = 1.25; [L43] unsigned char var_1_27 = 32; [L44] signed short int var_1_28 = -4; [L45] unsigned char var_1_29 = 0; [L46] signed long int last_1_var_1_1 = 0; [L47] signed long int last_1_var_1_5 = 2; [L48] signed short int last_1_var_1_6 = -10; [L49] unsigned long int last_1_var_1_7 = 1; [L50] float last_1_var_1_14 = 5.4; [L51] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L167] isInitial = 1 [L168] FCALL initially() [L169] COND TRUE 1 [L170] CALL updateLastVariables() [L155] last_1_var_1_1 = var_1_1 [L156] last_1_var_1_5 = var_1_5 [L157] last_1_var_1_6 = var_1_6 [L158] last_1_var_1_7 = var_1_7 [L159] last_1_var_1_14 = var_1_14 [L160] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L170] RET updateLastVariables() [L171] CALL updateVariables() [L118] var_1_9 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L119] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L120] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L120] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L122] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L123] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L123] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L124] var_1_12 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L125] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L126] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L126] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L127] var_1_13 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L128] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L129] var_1_15 = __VERIFIER_nondet_float() [L130] 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_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L130] 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_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L131] var_1_16 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L132] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L133] var_1_20 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L134] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L135] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L135] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L136] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L136] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=156/5, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L137] var_1_21 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L138] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=50, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L139] var_1_23 = __VERIFIER_nondet_long() [L140] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L140] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L141] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L141] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L142] var_1_24 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_24 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L143] RET assume_abort_if_not(var_1_24 >= -32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L144] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L144] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_26=5/4, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L145] var_1_26 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L146] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=32, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L147] var_1_27 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L148] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L149] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L149] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L150] var_1_29 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L151] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L152] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L152] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=2, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L171] RET updateVariables() [L172] CALL step() [L55] COND TRUE (32 / var_1_20) > -500 [L56] var_1_19 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L58] COND FALSE !((~ var_1_20) >= var_1_23) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=8, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L65] COND TRUE var_1_21 <= ((((var_1_19) > (var_1_26)) ? (var_1_19) : (var_1_26))) [L66] var_1_25 = (var_1_27 + 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L68] COND FALSE !((var_1_23 / var_1_20) > var_1_25) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L75] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L78] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=64, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L80] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L81] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L85] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=-255, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L86] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L89] signed long int stepLocal_3 = var_1_1; [L90] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=0, stepLocal_3=0, var_1_10=-255, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L91] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=-255, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L96] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=-255, var_1_14=27/5, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L97] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L104] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L106] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-17, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L107] COND TRUE var_1_6 < stepLocal_0 [L108] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L110] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=-7, stepLocal_5=-17, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-17] [L111] COND FALSE !((- 8u) >= stepLocal_4) [L114] var_1_8 = (((var_1_14 / var_1_12) >= var_1_14) || var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=-17, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] [L172] RET step() [L173] CALL, EXPR property() [L163-L164] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] [L173] RET, EXPR property() [L173] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=-255, var_1_14=3, var_1_16=3, var_1_17=0, var_1_19=2, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=1000, var_1_23=1, var_1_24=-32767, var_1_25=1, var_1_27=0, var_1_28=-4, var_1_29=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=1, var_1_9=-17] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 753 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 436 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 317 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2772/2772 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 02:15:12,466 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_fillercodesize_ps-cn-25_file-0.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 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:15:14,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:15:14,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:15:14,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:15:14,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:15:14,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:15:14,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:15:14,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:15:14,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:15:14,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:15:14,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:15:14,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:15:14,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:15:14,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:15:14,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:15:14,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:15:14,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:15:14,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:15:14,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:15:14,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:15:14,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:15:14,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:15:14,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:15:14,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:15:14,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:15:14,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:15:14,925 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:15:14,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:15:14,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:15:14,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:15:14,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:15:14,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:15:14,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:15:14,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:15:14,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:15:14,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:15:14,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:15:14,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:15:14,928 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:15:14,928 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:15:14,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:15:14,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:15:14,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:15:14,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:15:14,929 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 -> 919b64ad06374025a27f1e638c1fbab266347de62a505876fcba854b54111d09 [2024-11-12 02:15:15,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:15:15,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:15:15,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:15:15,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:15:15,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:15:15,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-11-12 02:15:16,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:15:17,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:15:17,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-11-12 02:15:17,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed36062a/e05059eea1294fd28722f4c394fd49b7/FLAG5e3c35bbd [2024-11-12 02:15:17,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed36062a/e05059eea1294fd28722f4c394fd49b7 [2024-11-12 02:15:17,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:15:17,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:15:17,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:15:17,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:15:17,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:15:17,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb67181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17, skipping insertion in model container [2024-11-12 02:15:17,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:15:17,481 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_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-11-12 02:15:17,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:15:17,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:15:17,625 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_fillercodesize_ps-cn-25_file-0.i[914,927] [2024-11-12 02:15:17,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:15:17,700 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:15:17,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17 WrapperNode [2024-11-12 02:15:17,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:15:17,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:15:17,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:15:17,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:15:17,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,770 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-12 02:15:17,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:15:17,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:15:17,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:15:17,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:15:17,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,820 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 02:15:17,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:15:17,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:15:17,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:15:17,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:15:17,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (1/1) ... [2024-11-12 02:15:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:15:17,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:15:17,910 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 02:15:17,917 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 02:15:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:15:17,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:15:17,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:15:17,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:15:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:15:17,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:15:18,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:15:18,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:15:43,963 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 02:15:43,963 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:15:43,978 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:15:43,982 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:15:43,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:43 BoogieIcfgContainer [2024-11-12 02:15:43,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:15:43,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:15:43,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:15:43,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:15:43,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:15:17" (1/3) ... [2024-11-12 02:15:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e372940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:43, skipping insertion in model container [2024-11-12 02:15:43,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:17" (2/3) ... [2024-11-12 02:15:43,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e372940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:43, skipping insertion in model container [2024-11-12 02:15:43,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:43" (3/3) ... [2024-11-12 02:15:43,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-0.i [2024-11-12 02:15:44,013 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:15:44,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:15:44,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:15:44,101 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;@7372d701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:15:44,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:15:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 02:15:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:15:44,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:15:44,118 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:15:44,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:15:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:15:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1864201580, now seen corresponding path program 1 times [2024-11-12 02:15:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:15:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164282646] [2024-11-12 02:15:44,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:44,143 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 02:15:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:15:44,147 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 02:15:44,162 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 02:15:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:45,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:15:45,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:15:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-12 02:15:45,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:15:45,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:15:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164282646] [2024-11-12 02:15:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164282646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:15:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:15:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:15:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077862441] [2024-11-12 02:15:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:15:45,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:15:45,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:15:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:15:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:15:45,739 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 02:15:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:15:45,763 INFO L93 Difference]: Finished difference Result 141 states and 242 transitions. [2024-11-12 02:15:45,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:15:45,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2024-11-12 02:15:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:15:45,771 INFO L225 Difference]: With dead ends: 141 [2024-11-12 02:15:45,771 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 02:15:45,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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 02:15:45,777 INFO L435 NwaCegarLoop]: 105 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, 105 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 02:15:45,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:15:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 02:15:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 02:15:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 02:15:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-12 02:15:45,820 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 148 [2024-11-12 02:15:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:15:45,821 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-12 02:15:45,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 02:15:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-12 02:15:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:15:45,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:15:45,825 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:15:45,865 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 02:15:46,026 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 02:15:46,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:15:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:15:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1988095880, now seen corresponding path program 1 times [2024-11-12 02:15:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:15:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862390720] [2024-11-12 02:15:46,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:15:46,030 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 02:15:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:15:46,032 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 02:15:46,033 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 02:15:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:15:47,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 02:15:47,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:16:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 02:16:04,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:16:04,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:16:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862390720] [2024-11-12 02:16:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862390720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:16:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:16:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:16:04,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222868120] [2024-11-12 02:16:04,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:16:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:16:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:16:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:16:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:16:04,572 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 02:16:10,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:16:14,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:16:18,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:16:23,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:16:27,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:16:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:16:27,406 INFO L93 Difference]: Finished difference Result 218 states and 327 transitions. [2024-11-12 02:16:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:16:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 02:16:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:16:27,699 INFO L225 Difference]: With dead ends: 218 [2024-11-12 02:16:27,699 INFO L226 Difference]: Without dead ends: 151 [2024-11-12 02:16:27,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:16:27,701 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 45 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:16:27,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 303 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 22.5s Time] [2024-11-12 02:16:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-12 02:16:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2024-11-12 02:16:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 02:16:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2024-11-12 02:16:27,742 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 148 [2024-11-12 02:16:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:16:27,743 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2024-11-12 02:16:27,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 02:16:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2024-11-12 02:16:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:16:27,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:16:27,746 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:16:27,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 02:16:27,947 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 02:16:27,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:16:27,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:16:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash 967027526, now seen corresponding path program 1 times [2024-11-12 02:16:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:16:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484989365] [2024-11-12 02:16:27,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:16:27,949 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 02:16:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:16:27,951 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 02:16:27,952 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 02:16:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:16:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:16:29,489 INFO L279 TraceCheckSpWp]: Computing forward predicates...