./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:14:09,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:14:09,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:14:09,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:14:09,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:14:09,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:14:09,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:14:09,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:14:09,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:14:09,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:14:09,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:14:09,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:14:09,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:14:09,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:14:09,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:14:09,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:14:09,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:14:09,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:14:09,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:14:09,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:14:09,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:14:09,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:14:09,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:14:09,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:14:09,510 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:14:09,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:14:09,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:14:09,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:14:09,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:14:09,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:14:09,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:14:09,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:14:09,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:14:09,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:14:09,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:14:09,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:14:09,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:14:09,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:14:09,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:14:09,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:14:09,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:14:09,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:14:09,517 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-11-12 01:14:09,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:14:09,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:14:09,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:14:09,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:14:09,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:14:09,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-11-12 01:14:11,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:14:11,472 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:14:11,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-11-12 01:14:11,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ac92291/80547c1b853f492eaae23fa68f55a05f/FLAG4a19b7ed6 [2024-11-12 01:14:11,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ac92291/80547c1b853f492eaae23fa68f55a05f [2024-11-12 01:14:11,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:14:11,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:14:11,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:14:11,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:14:11,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:14:11,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:11,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@828e0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11, skipping insertion in model container [2024-11-12 01:14:11,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:11,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:14:11,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-11-12 01:14:11,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:14:11,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:14:11,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-11-12 01:14:11,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:14:11,928 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:14:11,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11 WrapperNode [2024-11-12 01:14:11,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:14:11,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:14:11,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:14:11,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:14:11,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:11,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,008 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-11-12 01:14:12,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:14:12,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:14:12,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:14:12,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:14:12,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,045 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:14:12,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:14:12,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:14:12,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:14:12,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:14:12,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (1/1) ... [2024-11-12 01:14:12,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:14:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:14:12,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:14:12,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:14:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:14:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:14:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:14:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:14:12,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:14:12,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:14:12,306 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:14:12,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:14:12,682 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:14:12,683 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:14:12,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:14:12,702 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:14:12,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:14:12 BoogieIcfgContainer [2024-11-12 01:14:12,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:14:12,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:14:12,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:14:12,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:14:12,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:14:11" (1/3) ... [2024-11-12 01:14:12,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29eb2e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:14:12, skipping insertion in model container [2024-11-12 01:14:12,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:11" (2/3) ... [2024-11-12 01:14:12,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29eb2e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:14:12, skipping insertion in model container [2024-11-12 01:14:12,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:14:12" (3/3) ... [2024-11-12 01:14:12,715 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-40.i [2024-11-12 01:14:12,735 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:14:12,735 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:14:12,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:14:12,808 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;@36e7a92f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:14:12,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:14:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-11-12 01:14:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 01:14:12,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:14:12,837 INFO L218 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, 1, 1, 1, 1] [2024-11-12 01:14:12,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:14:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:14:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash 890785757, now seen corresponding path program 1 times [2024-11-12 01:14:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:14:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250365483] [2024-11-12 01:14:12,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:14:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:14:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:14:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:14:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:14:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:14:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:14:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:14:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:14:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:14:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:14:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:14:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:14:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:14:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:14:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:14:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:14:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 01:14:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:14:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 01:14:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:14:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:14:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:14:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:14:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:14:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:14:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:14:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:14:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:14:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:14:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:14:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 01:14:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:14:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250365483] [2024-11-12 01:14:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250365483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:14:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:14:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:14:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617986884] [2024-11-12 01:14:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:14:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:14:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:14:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:14:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:14:13,565 INFO L87 Difference]: Start difference. First operand has 76 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-12 01:14:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:14:13,596 INFO L93 Difference]: Finished difference Result 145 states and 258 transitions. [2024-11-12 01:14:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:14:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 183 [2024-11-12 01:14:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:14:13,610 INFO L225 Difference]: With dead ends: 145 [2024-11-12 01:14:13,610 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 01:14:13,615 INFO L434 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-11-12 01:14:13,621 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:14:13,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:14:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 01:14:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 01:14:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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-11-12 01:14:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-12 01:14:13,670 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 183 [2024-11-12 01:14:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:14:13,674 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-12 01:14:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-12 01:14:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-12 01:14:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 01:14:13,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:14:13,681 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 01:14:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:14:13,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:14:13,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:14:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -734572988, now seen corresponding path program 1 times [2024-11-12 01:14:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:14:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491453671] [2024-11-12 01:14:13,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:14:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:14:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:14:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:14:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:14:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:14:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:14:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:14:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:14:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:14:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:14:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:14:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:14:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:14:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:14:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:14:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:14:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 01:14:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:14:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 01:14:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:14:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:14:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:14:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:14:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:14:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:14:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:14:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:14:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:14:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:14:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:14:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-12 01:14:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:14:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491453671] [2024-11-12 01:14:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491453671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:14:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207329558] [2024-11-12 01:14:14,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:14,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:14:14,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:14:14,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:14:14,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:14:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:14,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 01:14:14,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:14:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 01:14:14,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:14:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-12 01:14:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207329558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:14:15,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:14:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 01:14:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867682044] [2024-11-12 01:14:15,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:14:15,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 01:14:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:14:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 01:14:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:14:15,234 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-11-12 01:14:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:14:15,552 INFO L93 Difference]: Finished difference Result 147 states and 216 transitions. [2024-11-12 01:14:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:14:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 184 [2024-11-12 01:14:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:14:15,555 INFO L225 Difference]: With dead ends: 147 [2024-11-12 01:14:15,556 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 01:14:15,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 424 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-11-12 01:14:15,558 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:14:15,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 138 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:14:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 01:14:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-12 01:14:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-11-12 01:14:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-12 01:14:15,578 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 184 [2024-11-12 01:14:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:14:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-12 01:14:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-11-12 01:14:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-12 01:14:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 01:14:15,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:14:15,582 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 01:14:15,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:14:15,783 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-11-12 01:14:15,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:14:15,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:14:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1543919614, now seen corresponding path program 1 times [2024-11-12 01:14:15,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:14:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571696392] [2024-11-12 01:14:15,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:14:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:14:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086677175] [2024-11-12 01:14:15,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:15,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:14:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:14:15,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:14:15,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 01:14:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:14:16,131 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:14:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:14:16,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:14:16,307 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:14:16,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:14:16,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 01:14:16,511 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-11-12 01:14:16,517 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 01:14:16,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:14:16,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:14:16 BoogieIcfgContainer [2024-11-12 01:14:16,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:14:16,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:14:16,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:14:16,649 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:14:16,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:14:12" (3/4) ... [2024-11-12 01:14:16,651 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:14:16,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:14:16,656 INFO L158 Benchmark]: Toolchain (without parser) took 5141.29ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 84.1MB in the beginning and 93.3MB in the end (delta: -9.2MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-11-12 01:14:16,656 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:14:16,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.96ms. Allocated memory is still 140.5MB. Free memory was 83.7MB in the beginning and 67.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 01:14:16,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.54ms. Allocated memory is still 140.5MB. Free memory was 67.7MB in the beginning and 63.9MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:14:16,657 INFO L158 Benchmark]: Boogie Preprocessor took 81.72ms. Allocated memory is still 140.5MB. Free memory was 63.9MB in the beginning and 57.2MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 01:14:16,657 INFO L158 Benchmark]: RCFGBuilder took 611.27ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 57.2MB in the beginning and 157.5MB in the end (delta: -100.3MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-12 01:14:16,658 INFO L158 Benchmark]: TraceAbstraction took 3942.25ms. Allocated memory is still 205.5MB. Free memory was 156.4MB in the beginning and 93.3MB in the end (delta: 63.1MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-11-12 01:14:16,658 INFO L158 Benchmark]: Witness Printer took 6.66ms. Allocated memory is still 205.5MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:14:16,660 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.25ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 102.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.96ms. Allocated memory is still 140.5MB. Free memory was 83.7MB in the beginning and 67.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.54ms. Allocated memory is still 140.5MB. Free memory was 67.7MB in the beginning and 63.9MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.72ms. Allocated memory is still 140.5MB. Free memory was 63.9MB in the beginning and 57.2MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 611.27ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 57.2MB in the beginning and 157.5MB in the end (delta: -100.3MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3942.25ms. Allocated memory is still 205.5MB. Free memory was 156.4MB in the beginning and 93.3MB in the end (delta: 63.1MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 6.66ms. Allocated memory is still 205.5MB. Free memory is still 93.3MB. 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; VAL [isInitial=0, 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=2, 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] [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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, var_1_9=0] [L83] var_1_25 = var_1_20 [L84] var_1_26 = var_1_6 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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, var_1_9=0] [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)) ; VAL [\result=0, 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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, var_1_9=0] [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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, 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=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=1, var_1_3=3, var_1_4=2, var_1_5=4, var_1_6=0, var_1_7=256, var_1_8=-65535, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 175 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 486 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 919 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 1253 SizeOfPredicates, 1 NumberOfNonLiveVariables, 405 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-11-12 01:14:16,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:14:19,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:14:19,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:14:19,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:14:19,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:14:19,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:14:19,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:14:19,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:14:19,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:14:19,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:14:19,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:14:19,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:14:19,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:14:19,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:14:19,120 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:14:19,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:14:19,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:14:19,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:14:19,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:14:19,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:14:19,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:14:19,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:14:19,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:14:19,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:14:19,126 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:14:19,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:14:19,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:14:19,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:14:19,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:14:19,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:14:19,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:14:19,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:14:19,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:14:19,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:14:19,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:14:19,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:14:19,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:14:19,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:14:19,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:14:19,131 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:14:19,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:14:19,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:14:19,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:14:19,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:14:19,132 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-11-12 01:14:19,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:14:19,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:14:19,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:14:19,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:14:19,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:14:19,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-11-12 01:14:20,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:14:21,167 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:14:21,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-11-12 01:14:21,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d45adc1/68e68ad0104743f1818e48127fc4f913/FLAG59f37e258 [2024-11-12 01:14:21,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d45adc1/68e68ad0104743f1818e48127fc4f913 [2024-11-12 01:14:21,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:14:21,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:14:21,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:14:21,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:14:21,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:14:21,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4347edfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21, skipping insertion in model container [2024-11-12 01:14:21,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:14:21,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-11-12 01:14:21,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:14:21,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:14:21,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i[913,926] [2024-11-12 01:14:21,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:14:21,600 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:14:21,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21 WrapperNode [2024-11-12 01:14:21,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:14:21,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:14:21,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:14:21,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:14:21,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,662 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-12 01:14:21,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:14:21,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:14:21,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:14:21,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:14:21,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,703 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:14:21,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:14:21,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:14:21,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:14:21,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:14:21,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (1/1) ... [2024-11-12 01:14:21,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:14:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:14:21,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:14:21,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:14:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:14:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:14:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:14:21,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:14:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:14:21,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:14:21,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:14:21,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:14:22,709 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:14:22,710 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:14:22,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:14:22,732 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:14:22,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:14:22 BoogieIcfgContainer [2024-11-12 01:14:22,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:14:22,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:14:22,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:14:22,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:14:22,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:14:21" (1/3) ... [2024-11-12 01:14:22,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272b320e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:14:22, skipping insertion in model container [2024-11-12 01:14:22,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:14:21" (2/3) ... [2024-11-12 01:14:22,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272b320e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:14:22, skipping insertion in model container [2024-11-12 01:14:22,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:14:22" (3/3) ... [2024-11-12 01:14:22,743 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-40.i [2024-11-12 01:14:22,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:14:22,762 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:14:22,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:14:22,846 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;@7bec2537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:14:22,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:14:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-11-12 01:14:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 01:14:22,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:14:22,871 INFO L218 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, 1, 1, 1, 1] [2024-11-12 01:14:22,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:14:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:14:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash 890785757, now seen corresponding path program 1 times [2024-11-12 01:14:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:14:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834049299] [2024-11-12 01:14:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:22,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:14:22,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:14:22,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:14:22,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:14:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:23,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:14:23,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:14:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-12 01:14:23,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:14:23,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:14:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834049299] [2024-11-12 01:14:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834049299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:14:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:14:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:14:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038646148] [2024-11-12 01:14:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:14:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:14:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:14:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:14:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:14:23,354 INFO L87 Difference]: Start difference. First operand has 76 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-12 01:14:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:14:23,393 INFO L93 Difference]: Finished difference Result 145 states and 258 transitions. [2024-11-12 01:14:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:14:23,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 183 [2024-11-12 01:14:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:14:23,407 INFO L225 Difference]: With dead ends: 145 [2024-11-12 01:14:23,407 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 01:14:23,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:14:23,417 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:14:23,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:14:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 01:14:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 01:14:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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-11-12 01:14:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-12 01:14:23,481 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 183 [2024-11-12 01:14:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:14:23,485 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-12 01:14:23,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-11-12 01:14:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-12 01:14:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 01:14:23,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:14:23,490 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 01:14:23,504 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-11-12 01:14:23,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:14:23,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:14:23,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:14:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash -734572988, now seen corresponding path program 1 times [2024-11-12 01:14:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:14:23,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840177338] [2024-11-12 01:14:23,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:14:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:14:23,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:14:23,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:14:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:23,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 01:14:23,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:14:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 01:14:24,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:14:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-12 01:14:24,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:14:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840177338] [2024-11-12 01:14:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840177338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:14:24,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:14:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 01:14:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330577262] [2024-11-12 01:14:24,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:14:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:14:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:14:24,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:14:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:14:24,750 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-11-12 01:14:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:14:25,849 INFO L93 Difference]: Finished difference Result 222 states and 324 transitions. [2024-11-12 01:14:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 01:14:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 184 [2024-11-12 01:14:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:14:25,855 INFO L225 Difference]: With dead ends: 222 [2024-11-12 01:14:25,856 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 01:14:25,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 360 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-11-12 01:14:25,860 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 147 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 01:14:25,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 299 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 01:14:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 01:14:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 74. [2024-11-12 01:14:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-11-12 01:14:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-12 01:14:25,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 184 [2024-11-12 01:14:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:14:25,888 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-12 01:14:25,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-11-12 01:14:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-12 01:14:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 01:14:25,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:14:25,892 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 01:14:25,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 01:14:26,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:14:26,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:14:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:14:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1543919614, now seen corresponding path program 1 times [2024-11-12 01:14:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:14:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862298166] [2024-11-12 01:14:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:14:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:14:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:14:26,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:14:26,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 01:14:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:14:26,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 01:14:26,352 INFO L279 TraceCheckSpWp]: Computing forward predicates...