./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:20:18,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:20:18,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:20:18,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:20:18,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:20:18,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:20:18,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:20:18,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:20:18,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:20:18,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:20:18,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:20:18,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:20:18,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:20:18,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:20:18,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:20:18,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:20:18,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:20:18,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:20:18,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:20:18,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:20:18,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:20:18,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:20:18,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:20:18,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:20:18,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:20:18,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:20:18,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:20:18,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:20:18,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:18,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:20:18,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:20:18,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:20:18,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:20:18,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:20:18,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:20:18,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:20:18,609 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 -> ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba [2024-10-24 05:20:18,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:20:18,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:20:18,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:20:18,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:20:18,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:20:18,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-10-24 05:20:20,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:20:20,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:20:20,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-10-24 05:20:20,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e390c1bd3/b0766c3affb14784ada24203d6c12d60/FLAGbc8815683 [2024-10-24 05:20:20,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e390c1bd3/b0766c3affb14784ada24203d6c12d60 [2024-10-24 05:20:20,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:20:20,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:20:20,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:20,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:20:20,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:20:20,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fcb51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20, skipping insertion in model container [2024-10-24 05:20:20,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:20:20,637 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-10-24 05:20:20,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:20,720 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:20:20,729 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-10-24 05:20:20,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:20,777 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:20:20,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20 WrapperNode [2024-10-24 05:20:20,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:20,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:20,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:20:20,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:20:20,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,849 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-10-24 05:20:20,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:20,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:20:20,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:20:20,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:20:20,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:20:20,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:20:20,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:20:20,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:20:20,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:20:20,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (1/1) ... [2024-10-24 05:20:20,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:20,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:20:20,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:20:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:20:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:20:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:20:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:20:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:20:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:20:21,084 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:20:21,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:20:21,375 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:20:21,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:20:21,438 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:20:21,439 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:20:21,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:21 BoogieIcfgContainer [2024-10-24 05:20:21,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:20:21,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:20:21,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:20:21,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:20:21,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:20:20" (1/3) ... [2024-10-24 05:20:21,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0fdf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:21, skipping insertion in model container [2024-10-24 05:20:21,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:20" (2/3) ... [2024-10-24 05:20:21,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0fdf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:21, skipping insertion in model container [2024-10-24 05:20:21,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:21" (3/3) ... [2024-10-24 05:20:21,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-40.i [2024-10-24 05:20:21,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:20:21,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:20:21,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:20:21,524 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;@6429b04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:20:21,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:20:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 05:20:21,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:21,564 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:21,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash -816833988, now seen corresponding path program 1 times [2024-10-24 05:20:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134855020] [2024-10-24 05:20:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:20:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:20:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:20:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:20:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:20:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:20:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:20:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:20:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:20:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:20:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:20:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:20:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:20:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:20:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:20:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:20:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 05:20:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:20:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 05:20:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:20:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:20:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:20:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:20:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:20:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:20:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:20:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:20:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:20:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:20:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:20:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 05:20:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:20:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134855020] [2024-10-24 05:20:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134855020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:20:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:20:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:20:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799376131] [2024-10-24 05:20:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:20:22,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:20:22,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:20:22,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:20:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:22,222 INFO L87 Difference]: Start difference. First operand has 69 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 05:20:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:22,256 INFO L93 Difference]: Finished difference Result 135 states and 248 transitions. [2024-10-24 05:20:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:20:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 178 [2024-10-24 05:20:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:22,268 INFO L225 Difference]: With dead ends: 135 [2024-10-24 05:20:22,269 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 05:20:22,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:22,278 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:22,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:20:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 05:20:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 05:20:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-24 05:20:22,326 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 178 [2024-10-24 05:20:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:22,333 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-24 05:20:22,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 05:20:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-24 05:20:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 05:20:22,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:22,340 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:22,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:20:22,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash 446963265, now seen corresponding path program 1 times [2024-10-24 05:20:22,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:22,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905696530] [2024-10-24 05:20:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:20:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:20:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:20:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:20:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:20:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:20:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:20:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:20:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:20:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:20:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:20:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:20:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:20:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:20:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:20:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:20:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 05:20:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:20:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 05:20:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:20:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:20:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:20:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:20:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:20:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:20:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:20:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:20:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:20:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:20:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 05:20:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:20:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905696530] [2024-10-24 05:20:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905696530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:20:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161931236] [2024-10-24 05:20:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:22,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:22,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:20:22,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:20:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:23,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 05:20:23,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-10-24 05:20:23,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:20:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161931236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:20:23,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:20:23,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 05:20:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194720193] [2024-10-24 05:20:23,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:20:23,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:20:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:20:23,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:20:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:20:23,481 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:20:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:23,677 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-10-24 05:20:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:20:23,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 179 [2024-10-24 05:20:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:23,680 INFO L225 Difference]: With dead ends: 139 [2024-10-24 05:20:23,680 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 05:20:23,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 05:20:23,682 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:23,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 118 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:20:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 05:20:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-10-24 05:20:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2024-10-24 05:20:23,697 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 179 [2024-10-24 05:20:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:23,698 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2024-10-24 05:20:23,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:20:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2024-10-24 05:20:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 05:20:23,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:23,700 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:23,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:20:23,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:23,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:23,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash 504221567, now seen corresponding path program 1 times [2024-10-24 05:20:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:23,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340518945] [2024-10-24 05:20:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:20:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747654270] [2024-10-24 05:20:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:23,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:20:23,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:23,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:20:23,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 05:20:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:20:24,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:20:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:20:24,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:20:24,366 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:20:24,367 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:20:24,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 05:20:24,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 05:20:24,574 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 05:20:24,659 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:20:24,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:20:24 BoogieIcfgContainer [2024-10-24 05:20:24,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:20:24,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:20:24,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:20:24,662 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:20:24,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:21" (3/4) ... [2024-10-24 05:20:24,664 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:20:24,665 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:20:24,666 INFO L158 Benchmark]: Toolchain (without parser) took 4204.91ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 146.6MB in the beginning and 86.2MB in the end (delta: 60.4MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-10-24 05:20:24,666 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:20:24,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.12ms. Allocated memory is still 178.3MB. Free memory was 146.4MB in the beginning and 134.7MB in the end (delta: 11.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-24 05:20:24,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.15ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 130.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:20:24,667 INFO L158 Benchmark]: Boogie Preprocessor took 81.27ms. Allocated memory is still 178.3MB. Free memory was 130.5MB in the beginning and 123.4MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:20:24,667 INFO L158 Benchmark]: RCFGBuilder took 506.47ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 95.6MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 05:20:24,668 INFO L158 Benchmark]: TraceAbstraction took 3219.64ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 94.8MB in the beginning and 86.2MB in the end (delta: 8.6MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-10-24 05:20:24,668 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 220.2MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:20:24,669 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.14ms. Allocated memory is still 125.8MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.12ms. Allocated memory is still 178.3MB. Free memory was 146.4MB in the beginning and 134.7MB in the end (delta: 11.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.15ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 130.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.27ms. Allocated memory is still 178.3MB. Free memory was 130.5MB in the beginning and 123.4MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 506.47ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 95.6MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3219.64ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 94.8MB in the beginning and 86.2MB in the end (delta: 8.6MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 220.2MB. Free memory is still 86.2MB. 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 137, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someUnaryDOUBLEoperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = -100; [L25] signed short int var_1_4 = -200; [L26] signed long int var_1_5 = -2; [L27] unsigned short int var_1_6 = 32; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 5; [L30] unsigned char var_1_9 = 1; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 16; [L34] double var_1_13 = 4.8; [L35] double var_1_14 = 8.4; [L36] unsigned char var_1_15 = 50; [L37] unsigned short int var_1_16 = 1; [L38] float var_1_17 = 25.4; [L39] signed long int var_1_19 = 2; [L40] float var_1_20 = 1.6; [L41] unsigned short int var_1_21 = 0; [L42] unsigned short int var_1_22 = 8; [L43] unsigned short int var_1_23 = 16; [L44] float var_1_24 = 128.5; [L45] double var_1_25 = -0.5; [L46] signed long int var_1_26 = 4; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L88] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L89] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L90] var_1_3 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L91] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L93] var_1_4 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L94] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L97] var_1_5 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L98] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L100] var_1_6 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_7=8, var_1_8=5, var_1_9=1] [L101] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_7=8, var_1_8=5, var_1_9=1] [L102] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L102] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L103] var_1_7 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_8=5, var_1_9=1] [L104] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_8=5, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L105] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=5, var_1_9=1] [L106] var_1_8 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_9=1] [L107] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L108] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L111] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L112] var_1_11 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L114] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L115] var_1_13 = __VERIFIER_nondet_double() [L116] 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, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L116] 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, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L118] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L119] var_1_15 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L120] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L122] var_1_19 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L127] var_1_22 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L128] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L130] var_1_23 = __VERIFIER_nondet_ushort() [L131] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L131] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L145] RET updateVariables() [L146] CALL step() [L50] COND TRUE ((var_1_3 * var_1_2) / var_1_4) <= var_1_5 [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=1] [L55] COND TRUE (var_1_5 != var_1_4) || var_1_10 [L56] var_1_9 = var_1_11 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L58] COND FALSE !((var_1_9 && var_1_11) && (50 > var_1_8)) [L65] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L67] var_1_16 = (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L68] COND TRUE (var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19) [L69] var_1_17 = var_1_20 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L71] COND FALSE !((var_1_10 && var_1_11) && var_1_9) [L74] var_1_21 = ((23370 - var_1_15) + var_1_23) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23371, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L76] COND FALSE !(! (-4 < var_1_22)) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23371, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L79] COND FALSE !(-4 > var_1_12) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23371, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L83] var_1_25 = var_1_20 [L84] var_1_26 = var_1_6 [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((((((((var_1_3 * var_1_2) / var_1_4) <= var_1_5) ? (var_1_1 == ((unsigned short int) var_1_6)) : (var_1_1 == ((unsigned short int) (var_1_7 + var_1_8)))) && (((var_1_5 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- var_1_13) < var_1_14) ? (var_1_10 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15)))))) && (((var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_10 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_12 + (var_1_15 + ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_23))))) && ((! (-4 < var_1_22)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_12) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_6)) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23371, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23371, var_1_22=0, var_1_23=1, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=1, var_1_3=1, var_1_4=2, var_1_5=3, var_1_6=0, var_1_7=256, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 160 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 894 NumberOfCodeBlocks, 894 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 1233 SizeOfPredicates, 1 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6861/6960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:20:24,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:20:26,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:20:26,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:20:26,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:20:26,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:20:27,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:20:27,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:20:27,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:20:27,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:20:27,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:20:27,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:20:27,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:20:27,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:20:27,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:20:27,011 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:20:27,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:20:27,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:20:27,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:20:27,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:20:27,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:20:27,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:20:27,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:20:27,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:20:27,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:20:27,013 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:20:27,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:20:27,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:20:27,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:20:27,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:20:27,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:20:27,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:20:27,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:20:27,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:20:27,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:20:27,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:27,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:20:27,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:20:27,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:20:27,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:20:27,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:20:27,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:20:27,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:20:27,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:20:27,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:20:27,018 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:20:27,018 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 -> ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba [2024-10-24 05:20:27,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:20:27,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:20:27,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:20:27,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:20:27,307 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:20:27,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-10-24 05:20:28,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:20:28,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:20:28,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-10-24 05:20:28,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d8f32f5/95bc8379bc5f4861bb50ddcdfeb6381c/FLAG58c055a73 [2024-10-24 05:20:28,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d8f32f5/95bc8379bc5f4861bb50ddcdfeb6381c [2024-10-24 05:20:28,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:20:28,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:20:28,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:28,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:20:28,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:20:28,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:28" (1/1) ... [2024-10-24 05:20:28,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d3ffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:28, skipping insertion in model container [2024-10-24 05:20:28,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:28" (1/1) ... [2024-10-24 05:20:28,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:20:29,090 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-10-24 05:20:29,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:29,169 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:20:29,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-10-24 05:20:29,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:29,228 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:20:29,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29 WrapperNode [2024-10-24 05:20:29,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:29,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:29,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:20:29,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:20:29,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,282 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-24 05:20:29,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:29,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:20:29,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:20:29,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:20:29,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,324 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:20:29,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:20:29,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:20:29,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:20:29,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:20:29,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (1/1) ... [2024-10-24 05:20:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:29,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:29,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:20:29,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:20:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:20:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:20:29,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:20:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:20:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:20:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:20:29,535 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:20:29,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:20:30,149 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:20:30,149 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:20:30,211 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:20:30,213 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:20:30,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:30 BoogieIcfgContainer [2024-10-24 05:20:30,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:20:30,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:20:30,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:20:30,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:20:30,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:20:28" (1/3) ... [2024-10-24 05:20:30,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29acd166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:30, skipping insertion in model container [2024-10-24 05:20:30,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:29" (2/3) ... [2024-10-24 05:20:30,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29acd166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:30, skipping insertion in model container [2024-10-24 05:20:30,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:30" (3/3) ... [2024-10-24 05:20:30,222 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-40.i [2024-10-24 05:20:30,236 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:20:30,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:20:30,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:20:30,289 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;@6be4da4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:20:30,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:20:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 05:20:30,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:30,309 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:30,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:30,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -816833988, now seen corresponding path program 1 times [2024-10-24 05:20:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783118165] [2024-10-24 05:20:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:30,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:20:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:30,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:20:30,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:20:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:30,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:20:30,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 05:20:30,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:20:30,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:20:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783118165] [2024-10-24 05:20:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783118165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:20:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:20:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:20:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483444808] [2024-10-24 05:20:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:20:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:20:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:20:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:20:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:30,815 INFO L87 Difference]: Start difference. First operand has 69 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 05:20:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:30,918 INFO L93 Difference]: Finished difference Result 135 states and 248 transitions. [2024-10-24 05:20:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:20:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 178 [2024-10-24 05:20:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:30,944 INFO L225 Difference]: With dead ends: 135 [2024-10-24 05:20:30,945 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 05:20:30,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:30,950 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:30,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:20:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 05:20:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 05:20:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-24 05:20:31,011 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 178 [2024-10-24 05:20:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:31,013 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-24 05:20:31,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 05:20:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-24 05:20:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 05:20:31,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:31,016 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:31,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:20:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:20:31,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:31,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash 446963265, now seen corresponding path program 1 times [2024-10-24 05:20:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:31,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385237954] [2024-10-24 05:20:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:31,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:20:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:31,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:20:31,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:20:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:31,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:20:31,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:20:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-10-24 05:20:31,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:20:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-24 05:20:32,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:20:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385237954] [2024-10-24 05:20:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385237954] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:20:32,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:20:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-24 05:20:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823324465] [2024-10-24 05:20:32,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:20:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:20:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:20:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:20:32,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:20:32,134 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:20:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:32,957 INFO L93 Difference]: Finished difference Result 211 states and 313 transitions. [2024-10-24 05:20:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 05:20:32,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 179 [2024-10-24 05:20:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:32,960 INFO L225 Difference]: With dead ends: 211 [2024-10-24 05:20:32,960 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 05:20:32,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:20:32,962 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 166 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:32,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 262 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:20:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 05:20:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 69. [2024-10-24 05:20:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:20:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2024-10-24 05:20:32,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 179 [2024-10-24 05:20:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:32,977 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2024-10-24 05:20:32,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 05:20:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2024-10-24 05:20:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 05:20:32,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:32,979 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:20:32,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:20:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:20:33,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:33,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash 504221567, now seen corresponding path program 1 times [2024-10-24 05:20:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:20:33,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242096064] [2024-10-24 05:20:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:33,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:20:33,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:20:33,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:20:33,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:20:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:33,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 05:20:33,388 INFO L278 TraceCheckSpWp]: Computing forward predicates...