./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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-dev-4a390ef-m [2024-10-24 08:55:21,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:55:21,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:55:21,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:55:21,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:55:21,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:55:21,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:55:21,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:55:21,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:55:21,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:55:21,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:55:21,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:55:21,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:55:21,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:55:21,747 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:55:21,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:55:21,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:55:21,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:55:21,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:55:21,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:55:21,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:55:21,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:55:21,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:55:21,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:55:21,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:55:21,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:55:21,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:55:21,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:55:21,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:55:21,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:55:21,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:55:21,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:55:21,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:21,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:55:21,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:55:21,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:55:21,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:55:21,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:55:21,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:55:21,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:55:21,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:55:21,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:55:21,756 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-24 08:55:22,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:55:22,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:55:22,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:55:22,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:55:22,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:55:22,087 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-24 08:55:23,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:55:23,581 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:55:23,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-24 08:55:23,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0d2e407/0c5a90d007584aec84ccca85b4fe93ae/FLAGedaf908f1 [2024-10-24 08:55:23,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0d2e407/0c5a90d007584aec84ccca85b4fe93ae [2024-10-24 08:55:23,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:55:23,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:55:23,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:23,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:55:23,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:55:23,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e22e933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:23, skipping insertion in model container [2024-10-24 08:55:23,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:23" (1/1) ... [2024-10-24 08:55:23,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:55:24,139 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-24 08:55:24,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:24,190 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:55:24,199 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-24 08:55:24,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:24,243 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:55:24,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24 WrapperNode [2024-10-24 08:55:24,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:24,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:24,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:55:24,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:55:24,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,297 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-10-24 08:55:24,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:24,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:55:24,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:55:24,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:55:24,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,335 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:55:24,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:55:24,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:55:24,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:55:24,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:55:24,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (1/1) ... [2024-10-24 08:55:24,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:24,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:55:24,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:55:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:55:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:55:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:55:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:55:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:55:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:55:24,548 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:55:24,551 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:55:24,879 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 08:55:24,880 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:55:24,932 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:55:24,933 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:55:24,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:24 BoogieIcfgContainer [2024-10-24 08:55:24,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:55:24,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:55:24,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:55:24,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:55:24,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:55:23" (1/3) ... [2024-10-24 08:55:24,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f8748c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:24, skipping insertion in model container [2024-10-24 08:55:24,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:24" (2/3) ... [2024-10-24 08:55:24,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f8748c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:24, skipping insertion in model container [2024-10-24 08:55:24,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:24" (3/3) ... [2024-10-24 08:55:24,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-24 08:55:24,957 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:55:24,958 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:55:25,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:55:25,071 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;@3159bf9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:55:25,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:55:25,076 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-24 08:55:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 08:55:25,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:25,094 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-24 08:55:25,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1478609438, now seen corresponding path program 1 times [2024-10-24 08:55:25,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:25,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309131996] [2024-10-24 08:55:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:55:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:55:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:55:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:55:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:55:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:55:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:55:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:55:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:55:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:55:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:55:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:55:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:55:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:55:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:55:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:55:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:55:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:55:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:55:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:55:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:55:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:55:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:55:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:55:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:55:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:55:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 08:55:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 08:55:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 08:55:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:25,656 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-24 08:55:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:55:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309131996] [2024-10-24 08:55:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309131996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:25,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:55:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274090150] [2024-10-24 08:55:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:55:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:55:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:55:25,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:55:25,697 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-24 08:55:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:25,755 INFO L93 Difference]: Finished difference Result 119 states and 221 transitions. [2024-10-24 08:55:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:55:25,760 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-24 08:55:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:25,768 INFO L225 Difference]: With dead ends: 119 [2024-10-24 08:55:25,769 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 08:55:25,773 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-24 08:55:25,777 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-24 08:55:25,780 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-24 08:55:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 08:55:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 08:55:25,840 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-24 08:55:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-24 08:55:25,847 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 168 [2024-10-24 08:55:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:25,847 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-24 08:55:25,848 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-24 08:55:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-24 08:55:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 08:55:25,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:25,858 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-24 08:55:25,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:55:25,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:25,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1774682677, now seen corresponding path program 1 times [2024-10-24 08:55:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986120444] [2024-10-24 08:55:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:55:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:55:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:55:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:55:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:55:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:55:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:55:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:55:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:55:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:55:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:55:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:55:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:55:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:55:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:55:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:55:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:55:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:55:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:55:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:55:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:55:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:55:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:55:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:55:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:26,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:55:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:55:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 08:55:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 08:55:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 08:55:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:27,029 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-24 08:55:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:55:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986120444] [2024-10-24 08:55:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986120444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:55:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460477340] [2024-10-24 08:55:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:27,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:55:27,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:27,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:55:27,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:55:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:27,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 08:55:27,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:55:27,763 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-24 08:55:27,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:55:28,252 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-24 08:55:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460477340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:55:28,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:55:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-24 08:55:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785410052] [2024-10-24 08:55:28,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:55:28,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 08:55:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:55:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 08:55:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:55:28,259 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-24 08:55:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:29,377 INFO L93 Difference]: Finished difference Result 274 states and 395 transitions. [2024-10-24 08:55:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-24 08:55:29,381 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-24 08:55:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:29,389 INFO L225 Difference]: With dead ends: 274 [2024-10-24 08:55:29,389 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 08:55:29,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 08:55:29,394 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.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:29,395 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.6s Time] [2024-10-24 08:55:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 08:55:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 68. [2024-10-24 08:55:29,433 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-24 08:55:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2024-10-24 08:55:29,440 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 169 [2024-10-24 08:55:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:29,441 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2024-10-24 08:55:29,441 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-24 08:55:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-10-24 08:55:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 08:55:29,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:29,444 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-24 08:55:29,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:55:29,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:55:29,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1774742259, now seen corresponding path program 1 times [2024-10-24 08:55:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689408305] [2024-10-24 08:55:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:55:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:55:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:55:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:55:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:55:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:55:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:55:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:55:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:55:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:55:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:55:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:55:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:55:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:55:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:55:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:55:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:55:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:55:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:55:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:55:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:55:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:55:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:55:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:55:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:55:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:55:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 08:55:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 08:55:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 08:55:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:31,719 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-24 08:55:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:55:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689408305] [2024-10-24 08:55:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689408305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:31,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:31,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:55:31,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015118389] [2024-10-24 08:55:31,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:31,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:55:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:55:31,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:55:31,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:55:31,723 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-24 08:55:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:31,976 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2024-10-24 08:55:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:55:31,977 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-24 08:55:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:31,982 INFO L225 Difference]: With dead ends: 85 [2024-10-24 08:55:31,982 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 08:55:31,983 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-24 08:55:31,983 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 23 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:31,984 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.1s Time] [2024-10-24 08:55:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 08:55:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-10-24 08:55:32,004 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-24 08:55:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-10-24 08:55:32,007 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 169 [2024-10-24 08:55:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:32,008 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-10-24 08:55:32,009 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-24 08:55:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-10-24 08:55:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 08:55:32,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:32,013 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-24 08:55:32,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:55:32,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1776529719, now seen corresponding path program 1 times [2024-10-24 08:55:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:55:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580882708] [2024-10-24 08:55:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:55:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:55:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064731905] [2024-10-24 08:55:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:32,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:55:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:32,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:55:32,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 08:55:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:32,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:55:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:32,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:55:32,275 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:55:32,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:55:32,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:55:32,478 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-24 08:55:32,482 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 08:55:32,598 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:55:32,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:55:32 BoogieIcfgContainer [2024-10-24 08:55:32,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:55:32,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:55:32,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:55:32,604 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:55:32,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:24" (3/4) ... [2024-10-24 08:55:32,606 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:55:32,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:55:32,608 INFO L158 Benchmark]: Toolchain (without parser) took 8673.58ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 146.1MB in the beginning and 101.7MB in the end (delta: 44.4MB). Peak memory consumption was 126.2MB. Max. memory is 16.1GB. [2024-10-24 08:55:32,608 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:55:32,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.05ms. Allocated memory is still 174.1MB. Free memory was 146.1MB in the beginning and 130.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 08:55:32,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.53ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 127.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:55:32,610 INFO L158 Benchmark]: Boogie Preprocessor took 51.86ms. Allocated memory is still 174.1MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:55:32,610 INFO L158 Benchmark]: RCFGBuilder took 581.62ms. Allocated memory is still 174.1MB. Free memory was 124.1MB in the beginning and 100.8MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 08:55:32,611 INFO L158 Benchmark]: TraceAbstraction took 7666.94ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 100.0MB in the beginning and 101.7MB in the end (delta: -1.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2024-10-24 08:55:32,611 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 255.9MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:55:32,612 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.16ms. Allocated memory is still 104.9MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.05ms. Allocated memory is still 174.1MB. Free memory was 146.1MB in the beginning and 130.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.53ms. Allocated memory is still 174.1MB. Free memory was 130.4MB in the beginning and 127.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.86ms. Allocated memory is still 174.1MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 581.62ms. Allocated memory is still 174.1MB. Free memory was 124.1MB in the beginning and 100.8MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7666.94ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 100.0MB in the beginning and 101.7MB in the end (delta: -1.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 255.9MB. Free memory is still 101.7MB. 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.4s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 0.6s 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, 539 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 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.5s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 839 ConstructedInterpolants, 0 QuantifiedInterpolants, 2909 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-24 08:55:32,659 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-dev-4a390ef-m [2024-10-24 08:55:34,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:55:34,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:55:34,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:55:34,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:55:35,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:55:35,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:55:35,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:55:35,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:55:35,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:55:35,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:55:35,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:55:35,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:55:35,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:55:35,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:55:35,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:55:35,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:55:35,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:55:35,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:55:35,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:55:35,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:55:35,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:55:35,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:55:35,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:55:35,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:55:35,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:55:35,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:55:35,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:55:35,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:55:35,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:55:35,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:55:35,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:55:35,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:55:35,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:55:35,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:35,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:55:35,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:55:35,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:55:35,037 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:55:35,037 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:55:35,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:55:35,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:55:35,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:55:35,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:55:35,038 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:55:35,038 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-24 08:55:35,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:55:35,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:55:35,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:55:35,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:55:35,337 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:55:35,339 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-24 08:55:36,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:55:37,040 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:55:37,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-24 08:55:37,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc3b0d2a/85018ce364cc46a1aad97217020d74c8/FLAGc41fc0bd0 [2024-10-24 08:55:37,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc3b0d2a/85018ce364cc46a1aad97217020d74c8 [2024-10-24 08:55:37,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:55:37,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:55:37,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:37,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:55:37,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:55:37,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b93a7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37, skipping insertion in model container [2024-10-24 08:55:37,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:55:37,653 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-24 08:55:37,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:37,734 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:55:37,748 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-24 08:55:37,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:55:37,802 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:55:37,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37 WrapperNode [2024-10-24 08:55:37,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:55:37,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:37,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:55:37,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:55:37,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,852 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-24 08:55:37,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:55:37,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:55:37,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:55:37,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:55:37,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:55:37,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:55:37,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:55:37,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:55:37,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:55:37,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (1/1) ... [2024-10-24 08:55:37,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:55:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:55:37,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:55:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:55:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:55:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:55:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:55:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:55:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:55:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:55:38,118 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:55:38,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:55:42,308 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 08:55:42,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:55:42,377 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:55:42,377 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:55:42,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:42 BoogieIcfgContainer [2024-10-24 08:55:42,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:55:42,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:55:42,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:55:42,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:55:42,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:55:37" (1/3) ... [2024-10-24 08:55:42,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:42, skipping insertion in model container [2024-10-24 08:55:42,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:55:37" (2/3) ... [2024-10-24 08:55:42,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:55:42, skipping insertion in model container [2024-10-24 08:55:42,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:55:42" (3/3) ... [2024-10-24 08:55:42,389 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-45.i [2024-10-24 08:55:42,407 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:55:42,408 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:55:42,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:55:42,469 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;@2bf561c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:55:42,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:55:42,474 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-24 08:55:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 08:55:42,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:42,486 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-24 08:55:42,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:42,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1478609438, now seen corresponding path program 1 times [2024-10-24 08:55:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788940086] [2024-10-24 08:55:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:42,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:55:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:42,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:55:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:55:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:42,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:55:42,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:55:42,880 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-24 08:55:42,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:55:42,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:55:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788940086] [2024-10-24 08:55:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788940086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:55:42,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:55:42,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:55:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845980578] [2024-10-24 08:55:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:55:42,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:55:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:55:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:55:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:55:42,917 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-24 08:55:45,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:55:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:45,351 INFO L93 Difference]: Finished difference Result 119 states and 221 transitions. [2024-10-24 08:55:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:55:45,377 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-24 08:55:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:45,382 INFO L225 Difference]: With dead ends: 119 [2024-10-24 08:55:45,382 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 08:55:45,385 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-24 08:55:45,388 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:45,388 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.4s Time] [2024-10-24 08:55:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 08:55:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 08:55:45,424 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-24 08:55:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2024-10-24 08:55:45,428 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 168 [2024-10-24 08:55:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:45,428 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2024-10-24 08:55:45,429 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-24 08:55:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2024-10-24 08:55:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 08:55:45,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:45,433 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-24 08:55:45,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:55:45,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:55:45,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1774682677, now seen corresponding path program 1 times [2024-10-24 08:55:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193202003] [2024-10-24 08:55:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:55:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:45,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:55:45,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:55:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:45,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 08:55:45,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:55:46,837 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-24 08:55:46,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:55:47,659 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-24 08:55:47,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:55:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193202003] [2024-10-24 08:55:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193202003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:55:47,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:55:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-24 08:55:47,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111314786] [2024-10-24 08:55:47,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:55:47,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 08:55:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:55:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 08:55:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:55:47,664 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-24 08:55:50,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:55:51,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:55:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:55:52,843 INFO L93 Difference]: Finished difference Result 203 states and 295 transitions. [2024-10-24 08:55:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 08:55:52,844 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-24 08:55:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:55:52,849 INFO L225 Difference]: With dead ends: 203 [2024-10-24 08:55:52,850 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 08:55:52,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 08:55:52,855 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 178 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:55:52,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 279 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 08:55:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 08:55:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 68. [2024-10-24 08:55:52,881 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-24 08:55:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2024-10-24 08:55:52,883 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 169 [2024-10-24 08:55:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:55:52,884 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2024-10-24 08:55:52,884 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-24 08:55:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-10-24 08:55:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-24 08:55:52,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:55:52,887 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-24 08:55:52,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 08:55:53,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:55:53,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:55:53,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:55:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1774742259, now seen corresponding path program 1 times [2024-10-24 08:55:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:55:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375237124] [2024-10-24 08:55:53,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:53,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:55:53,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:55:53,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:55:53,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:55:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:53,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:55:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:55:53,427 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-24 08:55:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1143971621] [2024-10-24 08:55:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:55:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:55:53,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:55:53,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:55:53,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 08:55:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:55:53,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 08:55:53,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:15,442 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 08:56:31,725 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 08:56:39,214 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 08:56:51,373 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)