./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_dependencies_file-99.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 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:29:41,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:29:41,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:29:41,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:29:41,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:29:41,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:29:41,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:29:41,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:29:41,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:29:41,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:29:41,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:29:41,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:29:41,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:29:41,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:29:41,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:29:41,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:29:41,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:29:41,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:29:41,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:29:41,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:29:41,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:29:41,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:29:41,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:29:41,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:29:41,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:29:41,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:29:41,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:29:41,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:29:41,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:29:41,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:29:41,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:29:41,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:29:41,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:29:41,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:29:41,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:29:41,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:29:41,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:29:41,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:29:41,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:29:41,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:29:41,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:29:41,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:29:41,589 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 -> 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb [2024-11-08 19:29:41,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:29:41,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:29:41,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:29:41,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:29:41,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:29:41,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-11-08 19:29:43,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:29:43,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:29:43,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-11-08 19:29:43,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec17903d5/f66252259e1a4ddebaa743cdc51909fa/FLAG15189c1c1 [2024-11-08 19:29:43,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec17903d5/f66252259e1a4ddebaa743cdc51909fa [2024-11-08 19:29:43,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:29:43,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:29:43,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:29:43,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:29:43,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:29:43,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:29:43" (1/1) ... [2024-11-08 19:29:43,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f8b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:43, skipping insertion in model container [2024-11-08 19:29:43,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:29:43" (1/1) ... [2024-11-08 19:29:43,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:29:43,885 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_dependencies_file-99.i[919,932] [2024-11-08 19:29:43,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:29:43,963 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:29:43,973 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_dependencies_file-99.i[919,932] [2024-11-08 19:29:44,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:29:44,046 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:29:44,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44 WrapperNode [2024-11-08 19:29:44,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:29:44,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:29:44,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:29:44,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:29:44,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,139 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-08 19:29:44,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:29:44,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:29:44,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:29:44,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:29:44,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,187 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-08 19:29:44,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:29:44,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:29:44,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:29:44,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:29:44,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (1/1) ... [2024-11-08 19:29:44,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:29:44,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:29:44,268 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-08 19:29:44,272 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-08 19:29:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:29:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:29:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:29:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:29:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:29:44,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:29:44,418 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:29:44,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:29:44,824 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 19:29:44,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:29:44,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:29:44,841 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:29:44,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:29:44 BoogieIcfgContainer [2024-11-08 19:29:44,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:29:44,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:29:44,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:29:44,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:29:44,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:29:43" (1/3) ... [2024-11-08 19:29:44,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137eb38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:29:44, skipping insertion in model container [2024-11-08 19:29:44,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:44" (2/3) ... [2024-11-08 19:29:44,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137eb38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:29:44, skipping insertion in model container [2024-11-08 19:29:44,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:29:44" (3/3) ... [2024-11-08 19:29:44,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-99.i [2024-11-08 19:29:44,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:29:44,872 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:29:44,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:29:44,951 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;@22fe8362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:29:44,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:29:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:29:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 19:29:44,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:29:44,970 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:29:44,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:29:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:29:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1999895674, now seen corresponding path program 1 times [2024-11-08 19:29:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:29:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684553956] [2024-11-08 19:29:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:29:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:29:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:29:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:29:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:29:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:29:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:29:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:29:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:29:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:29:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:29:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:29:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:29:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:29:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:29:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:29:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:29:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:29:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:29:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:29:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:29:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:29:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:29:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:29:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:29:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:29:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:29:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:29:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 19:29:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 19:29:45,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:29:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684553956] [2024-11-08 19:29:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684553956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:29:45,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:29:45,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:29:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452364253] [2024-11-08 19:29:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:29:45,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:29:45,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:29:45,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:29:45,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:29:45,549 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:29:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:29:45,581 INFO L93 Difference]: Finished difference Result 165 states and 289 transitions. [2024-11-08 19:29:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:29:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2024-11-08 19:29:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:29:45,594 INFO L225 Difference]: With dead ends: 165 [2024-11-08 19:29:45,595 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 19:29:45,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-08 19:29:45,604 INFO L432 NwaCegarLoop]: 125 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, 125 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-08 19:29:45,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:29:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 19:29:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 19:29:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:29:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-08 19:29:45,665 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 181 [2024-11-08 19:29:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:29:45,665 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-08 19:29:45,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:29:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-08 19:29:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 19:29:45,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:29:45,670 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:29:45,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:29:45,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:29:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:29:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1289901068, now seen corresponding path program 1 times [2024-11-08 19:29:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:29:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383179834] [2024-11-08 19:29:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:29:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:29:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:29:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:29:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:29:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:29:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:29:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:29:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:29:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:29:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 19:29:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:29:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:29:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:29:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:29:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:29:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:29:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 19:29:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:29:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:29:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:29:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 19:29:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 19:29:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 19:29:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 19:29:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:29:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:29:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:29:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 19:29:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 141 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-11-08 19:29:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:29:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383179834] [2024-11-08 19:29:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383179834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:29:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359235370] [2024-11-08 19:29:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:47,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:29:47,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:29:47,140 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-08 19:29:47,143 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-08 19:29:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:47,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 19:29:47,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:29:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-11-08 19:29:48,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:29:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-08 19:29:48,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359235370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:29:48,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:29:48,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-08 19:29:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666889374] [2024-11-08 19:29:48,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:29:48,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:29:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:29:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:29:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:29:48,935 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-11-08 19:29:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:29:50,113 INFO L93 Difference]: Finished difference Result 355 states and 516 transitions. [2024-11-08 19:29:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 19:29:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 181 [2024-11-08 19:29:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:29:50,121 INFO L225 Difference]: With dead ends: 355 [2024-11-08 19:29:50,123 INFO L226 Difference]: Without dead ends: 276 [2024-11-08 19:29:50,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 19:29:50,127 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 372 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:29:50,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 560 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 19:29:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-08 19:29:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 92. [2024-11-08 19:29:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:29:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-11-08 19:29:50,171 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 181 [2024-11-08 19:29:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:29:50,172 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-11-08 19:29:50,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-11-08 19:29:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-11-08 19:29:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 19:29:50,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:29:50,179 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:29:50,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:29:50,380 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-08 19:29:50,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:29:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:29:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1031735630, now seen corresponding path program 1 times [2024-11-08 19:29:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:29:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783959115] [2024-11-08 19:29:50,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:29:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953471214] [2024-11-08 19:29:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:50,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:29:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:29:50,454 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-08 19:29:50,456 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-08 19:29:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:29:50,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:29:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:29:50,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:29:50,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:29:50,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:29:50,798 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-08 19:29:50,977 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-08 19:29:50,983 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:29:51,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:29:51,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:29:51 BoogieIcfgContainer [2024-11-08 19:29:51,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:29:51,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:29:51,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:29:51,116 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:29:51,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:29:44" (3/4) ... [2024-11-08 19:29:51,120 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:29:51,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:29:51,122 INFO L158 Benchmark]: Toolchain (without parser) took 7448.62ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 86.6MB in the beginning and 147.4MB in the end (delta: -60.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-11-08 19:29:51,123 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:29:51,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.20ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 86.4MB in the beginning and 178.6MB in the end (delta: -92.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-08 19:29:51,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.03ms. Allocated memory is still 207.6MB. Free memory was 178.6MB in the beginning and 176.5MB in the end (delta: 2.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-08 19:29:51,126 INFO L158 Benchmark]: Boogie Preprocessor took 87.93ms. Allocated memory is still 207.6MB. Free memory was 176.5MB in the beginning and 170.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:29:51,127 INFO L158 Benchmark]: RCFGBuilder took 612.99ms. Allocated memory is still 207.6MB. Free memory was 170.2MB in the beginning and 145.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 19:29:51,127 INFO L158 Benchmark]: TraceAbstraction took 6270.91ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 144.0MB in the beginning and 147.4MB in the end (delta: -3.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2024-11-08 19:29:51,127 INFO L158 Benchmark]: Witness Printer took 5.70ms. Allocated memory is still 251.7MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:29:51,129 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.20ms. Allocated memory is still 142.6MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.20ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 86.4MB in the beginning and 178.6MB in the end (delta: -92.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.03ms. Allocated memory is still 207.6MB. Free memory was 178.6MB in the beginning and 176.5MB in the end (delta: 2.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.93ms. Allocated memory is still 207.6MB. Free memory was 176.5MB in the beginning and 170.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 612.99ms. Allocated memory is still 207.6MB. Free memory was 170.2MB in the beginning and 145.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6270.91ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 144.0MB in the beginning and 147.4MB in the end (delta: -3.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 5.70ms. Allocated memory is still 251.7MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryArithmeticDOUBLEoperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] signed long int var_1_6 = 25; [L28] double var_1_10 = 99999999999.25; [L29] double var_1_11 = 255.25; [L30] double var_1_12 = 1.125; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 32; [L34] unsigned char var_1_16 = 4; [L35] unsigned char var_1_17 = 2; [L36] signed char var_1_18 = 4; [L37] signed char var_1_19 = 16; [L38] signed char var_1_20 = 32; [L39] signed char var_1_21 = 25; [L40] signed char var_1_22 = 1; [L41] signed char var_1_23 = 100; [L42] double var_1_24 = 3.125; [L43] double var_1_25 = 0.0; [L44] unsigned short int var_1_26 = 32; [L45] unsigned short int var_1_27 = 36217; [L46] unsigned char var_1_28 = 2; VAL [isInitial=0, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L92] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L92] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L95] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L95] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L98] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L98] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L99] var_1_11 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L100] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L103] var_1_14 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L104] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L106] var_1_16 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L109] var_1_17 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L112] var_1_19 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L115] var_1_20 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L118] var_1_21 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_21 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] RET assume_abort_if_not(var_1_21 >= -63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L121] var_1_22 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L124] var_1_23 = __VERIFIER_nondet_char() [L125] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L127] var_1_25 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] RET assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L129] var_1_27 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_27 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L130] RET assume_abort_if_not(var_1_27 >= 32767) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L144] RET updateVariables() [L145] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = (var_1_3 || var_1_4) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L55] COND TRUE ! var_1_5 [L56] var_1_15 = (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L58] var_1_18 = ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23)))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L59] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L62] var_1_28 = var_1_16 [L63] var_1_6 = ((var_1_28 - var_1_26) + var_1_26) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L64] COND FALSE !(var_1_26 < (var_1_6 * var_1_28)) [L71] var_1_10 = var_1_12 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L73] COND TRUE var_1_12 != var_1_10 [L74] var_1_13 = var_1_14 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L82] EXPR var_1_20 ^ var_1_28 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L82] COND TRUE var_1_23 >= (var_1_20 ^ var_1_28) [L83] var_1_24 = ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L136-L137] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1)) && (var_1_1 ? (var_1_26 == ((unsigned short int) ((((((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) < ((var_1_27 - var_1_17))) ? (((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) : ((var_1_27 - var_1_17)))))) : 1)) && (var_1_28 == ((unsigned char) var_1_16)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 685 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 258 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 551 GetRequests, 504 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 43, 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, 184 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 905 NumberOfCodeBlocks, 905 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 720 ConstructedInterpolants, 0 QuantifiedInterpolants, 3021 SizeOfPredicates, 4 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6070/6496 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-08 19:29:51,161 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_dependencies_file-99.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 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:29:53,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:29:53,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:29:53,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:29:53,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:29:53,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:29:53,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:29:53,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:29:53,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:29:53,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:29:53,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:29:53,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:29:53,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:29:53,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:29:53,596 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:29:53,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:29:53,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:29:53,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:29:53,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:29:53,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:29:53,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:29:53,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:29:53,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:29:53,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:29:53,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:29:53,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:29:53,603 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:29:53,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:29:53,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:29:53,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:29:53,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:29:53,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:29:53,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:29:53,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:29:53,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:29:53,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:29:53,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:29:53,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:29:53,606 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:29:53,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:29:53,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:29:53,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:29:53,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:29:53,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:29:53,610 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 -> 1f9a5c686ad01cfcc91f09109693d5ac5bccd775344ac75524882bf1ef1e7afb [2024-11-08 19:29:53,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:29:53,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:29:53,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:29:53,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:29:53,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:29:53,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-11-08 19:29:55,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:29:55,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:29:55,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-99.i [2024-11-08 19:29:55,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8917c67/2daafba209b44b88bbd3283e83a2e44d/FLAGa201576e0 [2024-11-08 19:29:55,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8917c67/2daafba209b44b88bbd3283e83a2e44d [2024-11-08 19:29:55,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:29:55,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:29:55,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:29:55,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:29:55,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:29:55,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:29:55" (1/1) ... [2024-11-08 19:29:55,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2f36bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:55, skipping insertion in model container [2024-11-08 19:29:55,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:29:55" (1/1) ... [2024-11-08 19:29:55,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:29:56,117 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_dependencies_file-99.i[919,932] [2024-11-08 19:29:56,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:29:56,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:29:56,229 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_dependencies_file-99.i[919,932] [2024-11-08 19:29:56,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:29:56,295 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:29:56,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56 WrapperNode [2024-11-08 19:29:56,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:29:56,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:29:56,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:29:56,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:29:56,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,357 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-08 19:29:56,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:29:56,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:29:56,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:29:56,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:29:56,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,411 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-08 19:29:56,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:29:56,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:29:56,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:29:56,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:29:56,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (1/1) ... [2024-11-08 19:29:56,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:29:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:29:56,485 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-08 19:29:56,488 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-08 19:29:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:29:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:29:56,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:29:56,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:29:56,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:29:56,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:29:56,630 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:29:56,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:29:58,474 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:29:58,475 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:29:58,487 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:29:58,488 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:29:58,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:29:58 BoogieIcfgContainer [2024-11-08 19:29:58,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:29:58,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:29:58,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:29:58,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:29:58,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:29:55" (1/3) ... [2024-11-08 19:29:58,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffeb96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:29:58, skipping insertion in model container [2024-11-08 19:29:58,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:29:56" (2/3) ... [2024-11-08 19:29:58,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffeb96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:29:58, skipping insertion in model container [2024-11-08 19:29:58,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:29:58" (3/3) ... [2024-11-08 19:29:58,501 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-99.i [2024-11-08 19:29:58,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:29:58,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:29:58,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:29:58,607 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;@2409264e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:29:58,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:29:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:29:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 19:29:58,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:29:58,637 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:29:58,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:29:58,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:29:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1122608119, now seen corresponding path program 1 times [2024-11-08 19:29:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:29:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132324511] [2024-11-08 19:29:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:58,658 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-08 19:29:58,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:29:58,662 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-08 19:29:58,663 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-08 19:29:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:59,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:29:59,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:29:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-08 19:29:59,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:29:59,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:29:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132324511] [2024-11-08 19:29:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132324511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:29:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:29:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:29:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326534771] [2024-11-08 19:29:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:29:59,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:29:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:29:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:29:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:29:59,155 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:29:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:29:59,195 INFO L93 Difference]: Finished difference Result 143 states and 253 transitions. [2024-11-08 19:29:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:29:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 178 [2024-11-08 19:29:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:29:59,206 INFO L225 Difference]: With dead ends: 143 [2024-11-08 19:29:59,206 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 19:29:59,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:29:59,216 INFO L432 NwaCegarLoop]: 107 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, 107 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-08 19:29:59,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:29:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 19:29:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 19:29:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:29:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2024-11-08 19:29:59,269 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 178 [2024-11-08 19:29:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:29:59,271 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2024-11-08 19:29:59,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 19:29:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2024-11-08 19:29:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 19:29:59,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:29:59,278 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:29:59,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:29:59,479 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-08 19:29:59,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:29:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:29:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 760573647, now seen corresponding path program 1 times [2024-11-08 19:29:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:29:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645836317] [2024-11-08 19:29:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:29:59,482 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-08 19:29:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:29:59,484 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-08 19:29:59,485 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-08 19:29:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:59,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:29:59,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:30:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-11-08 19:30:01,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:30:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-08 19:30:02,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:30:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645836317] [2024-11-08 19:30:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645836317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:30:02,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:30:02,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-08 19:30:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735314150] [2024-11-08 19:30:02,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:30:02,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:30:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:30:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:30:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:30:02,454 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 19:30:04,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:30:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:30:05,815 INFO L93 Difference]: Finished difference Result 233 states and 335 transitions. [2024-11-08 19:30:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 19:30:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 178 [2024-11-08 19:30:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:30:05,819 INFO L225 Difference]: With dead ends: 233 [2024-11-08 19:30:05,819 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 19:30:05,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 19:30:05,822 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 234 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:30:05,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 402 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 19:30:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 19:30:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 81. [2024-11-08 19:30:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 19:30:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2024-11-08 19:30:05,849 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 178 [2024-11-08 19:30:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:30:05,851 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2024-11-08 19:30:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-08 19:30:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2024-11-08 19:30:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 19:30:05,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:30:05,855 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:30:05,868 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-08 19:30:06,055 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-08 19:30:06,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:30:06,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:30:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1440632017, now seen corresponding path program 1 times [2024-11-08 19:30:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:30:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923064221] [2024-11-08 19:30:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:30:06,058 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-08 19:30:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:30:06,061 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-08 19:30:06,063 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-08 19:30:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:06,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:30:06,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:30:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 760 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-08 19:30:07,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:30:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 19:30:08,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:30:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923064221] [2024-11-08 19:30:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923064221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:30:08,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:30:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-08 19:30:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532023384] [2024-11-08 19:30:08,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:30:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:30:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:30:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:30:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:30:08,759 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-08 19:30:11,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:30:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:30:11,552 INFO L93 Difference]: Finished difference Result 211 states and 284 transitions. [2024-11-08 19:30:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:30:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 178 [2024-11-08 19:30:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:30:11,555 INFO L225 Difference]: With dead ends: 211 [2024-11-08 19:30:11,555 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 19:30:11,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:30:11,557 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 184 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:30:11,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 209 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 19:30:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 19:30:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 118. [2024-11-08 19:30:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 73 states have internal predecessors, (82), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 19:30:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2024-11-08 19:30:11,584 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 158 transitions. Word has length 178 [2024-11-08 19:30:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:30:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 158 transitions. [2024-11-08 19:30:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2024-11-08 19:30:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 158 transitions. [2024-11-08 19:30:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 19:30:11,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:30:11,588 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:30:11,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 19:30:11,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:30:11,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:30:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:30:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash -928313458, now seen corresponding path program 1 times [2024-11-08 19:30:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:30:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715442564] [2024-11-08 19:30:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:30:11,795 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-08 19:30:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:30:11,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:30:11,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:30:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:12,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 19:30:12,387 INFO L278 TraceCheckSpWp]: Computing forward predicates...