./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.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 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:03:58,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:03:58,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:03:58,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:03:58,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:03:58,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:03:58,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:03:58,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:03:58,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:03:58,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:03:58,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:03:58,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:03:58,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:03:58,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:03:58,140 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:03:58,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:03:58,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:03:58,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:03:58,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:03:58,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:03:58,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:03:58,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:03:58,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:03:58,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:03:58,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:03:58,158 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:03:58,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:03:58,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:03:58,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:03:58,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:03:58,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:03:58,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:03:58,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:03:58,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:03:58,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:03:58,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:03:58,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:03:58,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:03:58,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:03:58,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:03:58,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:03:58,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:03:58,164 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 -> 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 [2024-10-14 11:03:58,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:03:58,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:03:58,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:03:58,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:03:58,452 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:03:58,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-14 11:03:59,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:04:00,151 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:04:00,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-14 11:04:00,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10a90498/ed95b5629af942a8be82de6071f1b43c/FLAGa3dd358ec [2024-10-14 11:04:00,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10a90498/ed95b5629af942a8be82de6071f1b43c [2024-10-14 11:04:00,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:04:00,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:04:00,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:04:00,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:04:00,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:04:00,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1afebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00, skipping insertion in model container [2024-10-14 11:04:00,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:04:00,392 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i[916,929] [2024-10-14 11:04:00,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:04:00,458 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:04:00,474 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i[916,929] [2024-10-14 11:04:00,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:04:00,544 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:04:00,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00 WrapperNode [2024-10-14 11:04:00,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:04:00,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:04:00,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:04:00,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:04:00,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,618 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-10-14 11:04:00,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:04:00,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:04:00,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:04:00,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:04:00,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,659 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:04:00,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:04:00,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:04:00,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:04:00,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:04:00,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (1/1) ... [2024-10-14 11:04:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:04:00,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:04:00,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:04:00,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:04:00,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:04:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:04:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:04:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:04:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:04:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:04:00,851 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:04:00,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:04:01,112 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:04:01,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:04:01,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:04:01,179 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:04:01,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:01 BoogieIcfgContainer [2024-10-14 11:04:01,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:04:01,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:04:01,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:04:01,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:04:01,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:04:00" (1/3) ... [2024-10-14 11:04:01,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464d5ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:04:01, skipping insertion in model container [2024-10-14 11:04:01,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:00" (2/3) ... [2024-10-14 11:04:01,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464d5ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:04:01, skipping insertion in model container [2024-10-14 11:04:01,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:01" (3/3) ... [2024-10-14 11:04:01,191 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-14 11:04:01,208 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:04:01,208 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:04:01,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:04:01,273 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;@3c1c7e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:04:01,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:04:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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-10-14 11:04:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 11:04:01,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:01,297 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] [2024-10-14 11:04:01,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:01,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1478609438, now seen corresponding path program 1 times [2024-10-14 11:04:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:04:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244280983] [2024-10-14 11:04:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:04:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:04:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:04:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:04:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:04:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:04:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:04:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:04:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:04:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:04:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:04:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:04:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:04:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:04:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:04:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:04:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:04:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:04:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:04:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:04:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:04:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 11:04:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 11:04:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 11:04:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 11:04:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 11:04:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 11:04:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 11:04:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 11:04:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 11:04:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 11:04:01,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:04:01,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244280983] [2024-10-14 11:04:01,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244280983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:04:01,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:04:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:04:01,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961329753] [2024-10-14 11:04:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:04:01,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:04:01,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:04:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:04:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:04:01,915 INFO L87 Difference]: Start difference. First operand has 61 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10-14 11:04:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:04:01,969 INFO L93 Difference]: Finished difference Result 119 states and 221 transitions. [2024-10-14 11:04:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:04:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 168 [2024-10-14 11:04:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:04:01,981 INFO L225 Difference]: With dead ends: 119 [2024-10-14 11:04:01,981 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 11:04:01,985 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-10-14 11:04:01,988 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:04:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:04:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 11:04:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 11:04:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-10-14 11:04:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-14 11:04:02,029 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 168 [2024-10-14 11:04:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:04:02,030 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-14 11:04:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10-14 11:04:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-14 11:04:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 11:04:02,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:02,034 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] [2024-10-14 11:04:02,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:04:02,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1774682677, now seen corresponding path program 1 times [2024-10-14 11:04:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:04:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835900873] [2024-10-14 11:04:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:04:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:04:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:04:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:04:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:04:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:04:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:04:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:04:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:04:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:04:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:04:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:04:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:04:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:04:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:04:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:04:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:04:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:04:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:04:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:04:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:04:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 11:04:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 11:04:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 11:04:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 11:04:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 11:04:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 11:04:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 11:04:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 11:04:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 11:04:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 69 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-10-14 11:04:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:04:03,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835900873] [2024-10-14 11:04:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835900873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:04:03,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620999759] [2024-10-14 11:04:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:03,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:04:03,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:04:03,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:04:03,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:04:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:03,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 11:04:03,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:04:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 899 proven. 69 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-10-14 11:04:04,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:04:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 72 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-14 11:04:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620999759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:04:04,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:04:04,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-14 11:04:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003979461] [2024-10-14 11:04:04,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:04:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 11:04:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:04:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 11:04:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 11:04:04,485 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2024-10-14 11:04:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:04:05,697 INFO L93 Difference]: Finished difference Result 274 states and 395 transitions. [2024-10-14 11:04:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-14 11:04:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 169 [2024-10-14 11:04:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:04:05,701 INFO L225 Difference]: With dead ends: 274 [2024-10-14 11:04:05,702 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 11:04:05,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 11:04:05,705 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 172 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:04:05,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 362 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 11:04:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 11:04:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 68. [2024-10-14 11:04:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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-10-14 11:04:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2024-10-14 11:04:05,748 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 169 [2024-10-14 11:04:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:04:05,749 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2024-10-14 11:04:05,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2024-10-14 11:04:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-10-14 11:04:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 11:04:05,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:05,755 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] [2024-10-14 11:04:05,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:04:05,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:04:05,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1774742259, now seen corresponding path program 1 times [2024-10-14 11:04:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:04:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321643875] [2024-10-14 11:04:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:04:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:04:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:04:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:04:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:04:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:04:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:04:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:04:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:04:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:04:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:04:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:04:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:04:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:04:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:04:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:04:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:04:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:04:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:04:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 11:04:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 11:04:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 11:04:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 11:04:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 11:04:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 11:04:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 11:04:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 11:04:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 11:04:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 11:04:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 11:04:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 11:04:08,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:04:08,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321643875] [2024-10-14 11:04:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321643875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:04:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:04:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:04:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710411820] [2024-10-14 11:04:08,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:04:08,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:04:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:04:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:04:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:04:08,218 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 11:04:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:04:08,528 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2024-10-14 11:04:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:04:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 169 [2024-10-14 11:04:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:04:08,531 INFO L225 Difference]: With dead ends: 85 [2024-10-14 11:04:08,531 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 11:04:08,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:04:08,535 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 23 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:04:08,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 257 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:04:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 11:04:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-10-14 11:04:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-10-14 11:04:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-10-14 11:04:08,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 169 [2024-10-14 11:04:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:04:08,563 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-10-14 11:04:08,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-14 11:04:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-10-14 11:04:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 11:04:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:08,568 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] [2024-10-14 11:04:08,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:04:08,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:08,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1776529719, now seen corresponding path program 1 times [2024-10-14 11:04:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:04:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890102113] [2024-10-14 11:04:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:04:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:04:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435975389] [2024-10-14 11:04:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:08,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:04:08,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:04:08,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:04:08,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:04:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:04:08,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:04:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:04:08,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:04:08,898 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:04:08,899 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:04:08,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 11:04:09,101 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,SelfDestructingSolverStorable3 [2024-10-14 11:04:09,108 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 11:04:09,231 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:04:09,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:04:09 BoogieIcfgContainer [2024-10-14 11:04:09,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:04:09,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:04:09,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:04:09,240 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:04:09,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:01" (3/4) ... [2024-10-14 11:04:09,242 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:04:09,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:04:09,244 INFO L158 Benchmark]: Toolchain (without parser) took 9058.68ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 119.0MB in the beginning and 179.2MB in the end (delta: -60.2MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-10-14 11:04:09,244 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 130.2MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:04:09,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.13ms. Allocated memory is still 163.6MB. Free memory was 119.0MB in the beginning and 104.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:04:09,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.91ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 101.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:04:09,245 INFO L158 Benchmark]: Boogie Preprocessor took 66.90ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 98.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:04:09,247 INFO L158 Benchmark]: RCFGBuilder took 492.52ms. Allocated memory is still 163.6MB. Free memory was 98.0MB in the beginning and 75.6MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 11:04:09,247 INFO L158 Benchmark]: TraceAbstraction took 8055.75ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 74.4MB in the beginning and 180.2MB in the end (delta: -105.9MB). Peak memory consumption was 825.3kB. Max. memory is 16.1GB. [2024-10-14 11:04:09,247 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 268.4MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:04:09,249 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.24ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 130.2MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.13ms. Allocated memory is still 163.6MB. Free memory was 119.0MB in the beginning and 104.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.91ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 101.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.90ms. Allocated memory is still 163.6MB. Free memory was 101.6MB in the beginning and 98.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 492.52ms. Allocated memory is still 163.6MB. Free memory was 98.0MB in the beginning and 75.6MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8055.75ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 74.4MB in the beginning and 180.2MB in the end (delta: -105.9MB). Peak memory consumption was 825.3kB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 268.4MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 999999; [L23] unsigned short int var_1_2 = 5; [L24] signed long int var_1_4 = -2; [L25] signed long int var_1_6 = 0; [L26] signed long int var_1_7 = 5; [L27] signed long int var_1_8 = 255; [L28] signed long int var_1_9 = 25; [L29] unsigned char var_1_10 = 0; [L30] signed long int var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 0; [L35] unsigned char var_1_16 = 1; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 64; [L38] signed char var_1_19 = -10; [L39] unsigned char var_1_20 = 5; [L40] unsigned char last_1_var_1_18 = 64; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] last_1_var_1_18 = var_1_18 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L66] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L66] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=-2, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=0, var_1_7=5, var_1_8=255, var_1_9=25] [L70] var_1_6 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_6 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L72] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=5, var_1_8=255, var_1_9=25] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L75] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L75] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=255, var_1_9=25] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L78] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L78] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L80] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L81] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L81] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L82] var_1_11 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L84] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L84] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L87] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L88] var_1_14 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L89] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L90] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L92] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L93] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L93] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L95] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L96] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L96] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L98] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L99] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L99] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=-10, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L100] var_1_19 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L101] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L102] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L102] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L103] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L103] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=5, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L104] var_1_20 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L106] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L106] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L120] RET updateVariables() [L121] CALL step() [L44] COND FALSE !(((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=999999, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L47] COND TRUE (var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18))) [L48] var_1_1 = ((var_1_6 - var_1_7) - var_1_8) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=0, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L52] COND TRUE var_1_18 == var_1_18 VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=0, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L53] COND FALSE !(\read(var_1_10)) [L56] var_1_12 = (((var_1_8 >= var_1_1) || var_1_15) && ((var_1_13 || var_1_16) && var_1_17)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=0, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=25] [L59] COND TRUE \read(var_1_12) [L60] var_1_9 = (((((var_1_8) < (var_1_6)) ? (var_1_8) : (var_1_6))) - (var_1_11 - 0.8f)) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=0, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0] [L121] RET step() [L122] CALL, EXPR property() [L112-L113] return (((((var_1_18 / 32) < (((((var_1_18 + var_1_18)) < (var_1_18)) ? ((var_1_18 + var_1_18)) : (var_1_18)))) ? (var_1_1 == ((signed long int) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((signed long int) (var_1_8 - var_1_7)))) && (var_1_12 ? (var_1_9 == ((signed long int) (((((var_1_8) < (var_1_6)) ? (var_1_8) : (var_1_6))) - (var_1_11 - 0.8f)))) : 1)) && ((var_1_18 == var_1_18) ? (var_1_10 ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) (((var_1_8 >= var_1_1) || var_1_15) && ((var_1_13 || var_1_16) && var_1_17))))) : 1)) && ((((var_1_2 + var_1_4) / var_1_19) != last_1_var_1_18) ? (var_1_18 == ((unsigned char) var_1_20)) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=0, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=19] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, var_1_10=0, var_1_11=2147483647, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=64, var_1_19=1, var_1_1=0, var_1_20=0, var_1_2=0, var_1_4=64, var_1_6=2147483647, var_1_7=2147483647, var_1_8=0, var_1_9=19] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 276 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 538 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=3, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 157 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 839 ConstructedInterpolants, 0 QuantifiedInterpolants, 3514 SizeOfPredicates, 4 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 7910/8120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:04:09,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.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 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:04:11,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:04:11,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:04:11,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:04:11,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:04:11,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:04:11,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:04:11,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:04:11,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:04:11,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:04:11,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:04:11,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:04:11,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:04:11,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:04:11,708 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:04:11,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:04:11,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:04:11,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:04:11,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:04:11,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:04:11,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:04:11,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:04:11,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:04:11,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:04:11,714 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:04:11,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:04:11,714 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:04:11,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:04:11,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:04:11,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:04:11,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:04:11,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:04:11,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:04:11,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:04:11,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:04:11,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:04:11,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:04:11,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:04:11,719 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:04:11,720 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:04:11,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:04:11,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:04:11,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:04:11,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:04:11,721 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:04:11,721 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 -> 294b7dcc801896cc0c4607275b340e3835112c15aaaacb8b365f279b8e190761 [2024-10-14 11:04:12,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:04:12,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:04:12,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:04:12,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:04:12,065 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:04:12,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-14 11:04:13,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:04:13,873 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:04:13,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-14 11:04:13,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/625f34834/5a17af5a149c48d28fedd451a5923cff/FLAGb7174e6d7 [2024-10-14 11:04:13,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/625f34834/5a17af5a149c48d28fedd451a5923cff [2024-10-14 11:04:13,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:04:13,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:04:13,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:04:13,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:04:13,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:04:13,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:04:13" (1/1) ... [2024-10-14 11:04:13,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639791e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:13, skipping insertion in model container [2024-10-14 11:04:13,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:04:13" (1/1) ... [2024-10-14 11:04:13,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:04:14,133 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i[916,929] [2024-10-14 11:04:14,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:04:14,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:04:14,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i[916,929] [2024-10-14 11:04:14,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:04:14,300 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:04:14,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14 WrapperNode [2024-10-14 11:04:14,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:04:14,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:04:14,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:04:14,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:04:14,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,364 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-14 11:04:14,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:04:14,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:04:14,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:04:14,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:04:14,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,407 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:04:14,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:04:14,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:04:14,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:04:14,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:04:14,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (1/1) ... [2024-10-14 11:04:14,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:04:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:04:14,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:04:14,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:04:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:04:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:04:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:04:14,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:04:14,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:04:14,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:04:14,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:04:14,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:04:20,433 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:04:20,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:04:20,491 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:04:20,491 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:04:20,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:20 BoogieIcfgContainer [2024-10-14 11:04:20,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:04:20,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:04:20,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:04:20,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:04:20,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:04:13" (1/3) ... [2024-10-14 11:04:20,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5330c33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:04:20, skipping insertion in model container [2024-10-14 11:04:20,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:04:14" (2/3) ... [2024-10-14 11:04:20,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5330c33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:04:20, skipping insertion in model container [2024-10-14 11:04:20,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:04:20" (3/3) ... [2024-10-14 11:04:20,500 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-14 11:04:20,519 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:04:20,519 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:04:20,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:04:20,604 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;@11559090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:04:20,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:04:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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-10-14 11:04:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 11:04:20,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:20,622 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] [2024-10-14 11:04:20,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:20,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1478609438, now seen corresponding path program 1 times [2024-10-14 11:04:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:04:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329864420] [2024-10-14 11:04:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:20,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:04:20,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:04:20,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:04:20,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:04:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:20,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:04:20,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:04:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-14 11:04:21,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:04:21,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:04:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329864420] [2024-10-14 11:04:21,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329864420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:04:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:04:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:04:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649429358] [2024-10-14 11:04:21,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:04:21,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:04:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:04:21,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:04:21,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:04:21,071 INFO L87 Difference]: Start difference. First operand has 61 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-10-14 11:04:24,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:04:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:04:24,004 INFO L93 Difference]: Finished difference Result 119 states and 221 transitions. [2024-10-14 11:04:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:04:24,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 168 [2024-10-14 11:04:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:04:24,040 INFO L225 Difference]: With dead ends: 119 [2024-10-14 11:04:24,041 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 11:04:24,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:04:24,046 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:04:24,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 11:04:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 11:04:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 11:04:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-10-14 11:04:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-14 11:04:24,108 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 168 [2024-10-14 11:04:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:04:24,109 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-14 11:04:24,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-10-14 11:04:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-14 11:04:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 11:04:24,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:24,120 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] [2024-10-14 11:04:24,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:04:24,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:04:24,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:24,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1774682677, now seen corresponding path program 1 times [2024-10-14 11:04:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:04:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147226827] [2024-10-14 11:04:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:04:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:04:24,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:04:24,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:04:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:24,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 11:04:24,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:04:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 899 proven. 69 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-10-14 11:04:25,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:04:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 93 proven. 72 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-14 11:04:26,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:04:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147226827] [2024-10-14 11:04:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147226827] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:04:26,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:04:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-14 11:04:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588504946] [2024-10-14 11:04:26,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:04:26,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:04:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:04:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:04:26,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:04:26,666 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-14 11:04:30,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:04:32,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:04:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:04:33,496 INFO L93 Difference]: Finished difference Result 203 states and 295 transitions. [2024-10-14 11:04:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 11:04:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 169 [2024-10-14 11:04:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:04:33,502 INFO L225 Difference]: With dead ends: 203 [2024-10-14 11:04:33,502 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 11:04:33,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 11:04:33,505 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 178 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:04:33,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 279 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-14 11:04:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 11:04:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 68. [2024-10-14 11:04:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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-10-14 11:04:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2024-10-14 11:04:33,534 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 169 [2024-10-14 11:04:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:04:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2024-10-14 11:04:33,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 3 states have call successors, (42), 3 states have call predecessors, (42), 7 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-10-14 11:04:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-10-14 11:04:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 11:04:33,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:04:33,542 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] [2024-10-14 11:04:33,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:04:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:04:33,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:04:33,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:04:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1774742259, now seen corresponding path program 1 times [2024-10-14 11:04:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:04:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350869372] [2024-10-14 11:04:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:33,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:04:33,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:04:33,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:04:33,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:04:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:04:33,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:04:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:04:34,113 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-14 11:04:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc5 [1135851850] [2024-10-14 11:04:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:04:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 11:04:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 11:04:34,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 11:04:34,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-14 11:04:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:04:34,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-14 11:04:34,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:05:00,774 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:05:08,872 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:05:17,000 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)