./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-81.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-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:59:16,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:59:16,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:59:16,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:59:16,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:59:16,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:59:16,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:59:16,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:59:16,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:59:16,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:59:16,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:59:16,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:59:16,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:59:16,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:59:16,815 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:59:16,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:59:16,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:59:16,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:59:16,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:59:16,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:59:16,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:59:16,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:59:16,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:59:16,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:59:16,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:59:16,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:59:16,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:59:16,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:59:16,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:59:16,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:59:16,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:59:16,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:59:16,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:16,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:59:16,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:59:16,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:59:16,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:59:16,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:59:16,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:59:16,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:59:16,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:59:16,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:59:16,822 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2024-10-24 08:59:17,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:59:17,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:59:17,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:59:17,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:59:17,053 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:59:17,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-24 08:59:18,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:59:18,554 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:59:18,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-24 08:59:18,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5f87172/734db65bafd849dd93dc01c5dbcff6e0/FLAG2b038f6b7 [2024-10-24 08:59:18,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5f87172/734db65bafd849dd93dc01c5dbcff6e0 [2024-10-24 08:59:18,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:59:18,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:59:18,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:18,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:59:18,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:59:18,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:18" (1/1) ... [2024-10-24 08:59:18,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cd514a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:18, skipping insertion in model container [2024-10-24 08:59:18,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:18" (1/1) ... [2024-10-24 08:59:18,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:59:19,113 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-81.i[916,929] [2024-10-24 08:59:19,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:19,172 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:59:19,190 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-81.i[916,929] [2024-10-24 08:59:19,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:19,255 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:59:19,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19 WrapperNode [2024-10-24 08:59:19,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:19,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:19,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:59:19,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:59:19,265 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:59:19" (1/1) ... [2024-10-24 08:59:19,271 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:59:19" (1/1) ... [2024-10-24 08:59:19,295 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-24 08:59:19,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:19,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:59:19,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:59:19,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:59:19,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,328 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:59:19,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:59:19,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:59:19,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:59:19,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:59:19,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (1/1) ... [2024-10-24 08:59:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:19,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:59:19,386 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:59:19,396 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:59:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:59:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:59:19,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:59:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:59:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:59:19,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:59:19,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:59:19,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:59:19,763 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:59:19,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:59:19,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:59:19,785 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:59:19,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:19 BoogieIcfgContainer [2024-10-24 08:59:19,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:59:19,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:59:19,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:59:19,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:59:19,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:59:18" (1/3) ... [2024-10-24 08:59:19,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e417438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:19, skipping insertion in model container [2024-10-24 08:59:19,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:19" (2/3) ... [2024-10-24 08:59:19,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e417438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:19, skipping insertion in model container [2024-10-24 08:59:19,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:19" (3/3) ... [2024-10-24 08:59:19,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-24 08:59:19,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:59:19,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:59:19,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:59:19,856 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;@607470b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:59:19,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:59:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:59:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 08:59:19,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:19,870 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:19,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:19,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 456306652, now seen corresponding path program 1 times [2024-10-24 08:59:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303259675] [2024-10-24 08:59:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:59:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:59:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:59:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:59:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:59:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303259675] [2024-10-24 08:59:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303259675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:20,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:20,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:59:20,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460598613] [2024-10-24 08:59:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:20,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:59:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:20,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:59:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:20,247 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:59:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:20,285 INFO L93 Difference]: Finished difference Result 127 states and 224 transitions. [2024-10-24 08:59:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:59:20,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-24 08:59:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:20,296 INFO L225 Difference]: With dead ends: 127 [2024-10-24 08:59:20,296 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 08:59:20,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:59:20,303 INFO L432 NwaCegarLoop]: 94 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, 94 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:59:20,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:59:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 08:59:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 08:59:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:59:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-24 08:59:20,349 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 135 [2024-10-24 08:59:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:20,349 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-24 08:59:20,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:59:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-24 08:59:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 08:59:20,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:20,354 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:20,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:59:20,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:20,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -841355620, now seen corresponding path program 1 times [2024-10-24 08:59:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069174824] [2024-10-24 08:59:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:59:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:59:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:59:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:59:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:59:20,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:20,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069174824] [2024-10-24 08:59:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069174824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:20,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:20,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393974798] [2024-10-24 08:59:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:20,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:20,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:20,726 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:20,917 INFO L93 Difference]: Finished difference Result 188 states and 290 transitions. [2024-10-24 08:59:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:20,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-24 08:59:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:20,923 INFO L225 Difference]: With dead ends: 188 [2024-10-24 08:59:20,923 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 08:59:20,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:20,925 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 65 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:20,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 250 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 08:59:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-10-24 08:59:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 08:59:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2024-10-24 08:59:20,956 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 135 [2024-10-24 08:59:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:20,959 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2024-10-24 08:59:20,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2024-10-24 08:59:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:59:20,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:20,962 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:59:20,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:20,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2041516913, now seen corresponding path program 1 times [2024-10-24 08:59:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514862496] [2024-10-24 08:59:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:59:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:59:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:59:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:59:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:59:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514862496] [2024-10-24 08:59:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514862496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:21,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:21,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:21,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869363211] [2024-10-24 08:59:21,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:21,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:21,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:21,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:21,203 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:21,279 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2024-10-24 08:59:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-24 08:59:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:21,286 INFO L225 Difference]: With dead ends: 198 [2024-10-24 08:59:21,286 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 08:59:21,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:21,289 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:21,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:59:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 08:59:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2024-10-24 08:59:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 08:59:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 186 transitions. [2024-10-24 08:59:21,304 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 186 transitions. Word has length 136 [2024-10-24 08:59:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:21,304 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 186 transitions. [2024-10-24 08:59:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 186 transitions. [2024-10-24 08:59:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 08:59:21,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:21,306 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:59:21,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1984258611, now seen corresponding path program 1 times [2024-10-24 08:59:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873532715] [2024-10-24 08:59:21,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:59:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:59:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:59:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:59:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:59:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873532715] [2024-10-24 08:59:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873532715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732862414] [2024-10-24 08:59:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:21,574 INFO L87 Difference]: Start difference. First operand 122 states and 186 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:21,650 INFO L93 Difference]: Finished difference Result 198 states and 304 transitions. [2024-10-24 08:59:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-24 08:59:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:21,653 INFO L225 Difference]: With dead ends: 198 [2024-10-24 08:59:21,654 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 08:59:21,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:21,655 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:21,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 252 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:59:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 08:59:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 118. [2024-10-24 08:59:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 08:59:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2024-10-24 08:59:21,678 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 136 [2024-10-24 08:59:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:21,679 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2024-10-24 08:59:21,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2024-10-24 08:59:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 08:59:21,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:21,683 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:21,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:59:21,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1106120698, now seen corresponding path program 1 times [2024-10-24 08:59:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042967597] [2024-10-24 08:59:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:59:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:59:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:59:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:59:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:59:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042967597] [2024-10-24 08:59:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042967597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934574578] [2024-10-24 08:59:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:21,928 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:22,045 INFO L93 Difference]: Finished difference Result 201 states and 303 transitions. [2024-10-24 08:59:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:22,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-10-24 08:59:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:22,047 INFO L225 Difference]: With dead ends: 201 [2024-10-24 08:59:22,047 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 08:59:22,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:22,048 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:22,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 255 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 08:59:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-10-24 08:59:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 08:59:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2024-10-24 08:59:22,066 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 139 [2024-10-24 08:59:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:22,066 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2024-10-24 08:59:22,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2024-10-24 08:59:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 08:59:22,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:22,071 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:22,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:59:22,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:22,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash 528028140, now seen corresponding path program 1 times [2024-10-24 08:59:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:22,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189032937] [2024-10-24 08:59:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:59:22,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:59:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:59:22,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:59:22,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:59:22,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:59:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:59:22,280 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 08:59:22,362 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:59:22,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:59:22 BoogieIcfgContainer [2024-10-24 08:59:22,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:59:22,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:59:22,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:59:22,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:59:22,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:19" (3/4) ... [2024-10-24 08:59:22,369 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:59:22,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:59:22,371 INFO L158 Benchmark]: Toolchain (without parser) took 3420.56ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 141.6MB in the beginning and 222.4MB in the end (delta: -80.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:59:22,372 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:59:22,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.59ms. Allocated memory is still 197.1MB. Free memory was 141.6MB in the beginning and 162.8MB in the end (delta: -21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 08:59:22,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 197.1MB. Free memory was 162.8MB in the beginning and 159.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:59:22,372 INFO L158 Benchmark]: Boogie Preprocessor took 56.73ms. Allocated memory is still 197.1MB. Free memory was 159.4MB in the beginning and 156.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:22,372 INFO L158 Benchmark]: RCFGBuilder took 431.02ms. Allocated memory is still 197.1MB. Free memory was 156.0MB in the beginning and 133.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:22,373 INFO L158 Benchmark]: TraceAbstraction took 2579.53ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 133.0MB in the beginning and 222.4MB in the end (delta: -89.4MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:22,373 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 272.6MB. Free memory is still 222.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:59:22,374 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.59ms. Allocated memory is still 197.1MB. Free memory was 141.6MB in the beginning and 162.8MB in the end (delta: -21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 197.1MB. Free memory was 162.8MB in the beginning and 159.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.73ms. Allocated memory is still 197.1MB. Free memory was 159.4MB in the beginning and 156.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.02ms. Allocated memory is still 197.1MB. Free memory was 156.0MB in the beginning and 133.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2579.53ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 133.0MB in the beginning and 222.4MB in the end (delta: -89.4MB). Peak memory consumption was 137.1MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 272.6MB. Free memory is still 222.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 4; [L25] signed long int var_1_4 = 2; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 999999999; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L106] last_1_var_1_13 = var_1_13 [L107] last_1_var_1_18 = var_1_18 [L117] RET updateLastVariables() [L118] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L81] RET assume_abort_if_not(var_1_5 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L83] var_1_6 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L95] var_1_15 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L98] var_1_16 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L102] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L118] RET updateVariables() [L119] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-2, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L110] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L110-L111] return (((var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 1113 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 657 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 456 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4620/4620 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:59:22,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:59:24,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:59:24,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:59:24,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:59:24,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:59:24,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:59:24,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:59:24,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:59:24,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:59:24,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:59:24,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:59:24,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:59:24,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:59:24,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:59:24,504 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:59:24,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:59:24,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:59:24,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:59:24,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:59:24,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:59:24,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:59:24,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:59:24,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:59:24,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:59:24,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:59:24,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:59:24,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:59:24,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:59:24,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:59:24,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:59:24,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:59:24,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:59:24,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:59:24,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:59:24,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:24,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:59:24,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:59:24,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:59:24,513 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:59:24,514 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:59:24,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:59:24,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:59:24,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:59:24,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:59:24,515 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:59:24,515 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2024-10-24 08:59:24,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:59:24,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:59:24,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:59:24,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:59:24,780 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:59:24,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-24 08:59:26,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:59:26,353 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:59:26,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-24 08:59:26,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a204274/f7e4a0c39df74325967b41261fa4a0d8/FLAGf0e775ceb [2024-10-24 08:59:26,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a204274/f7e4a0c39df74325967b41261fa4a0d8 [2024-10-24 08:59:26,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:59:26,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:59:26,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:26,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:59:26,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:59:26,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:26" (1/1) ... [2024-10-24 08:59:26,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee5ed25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:26, skipping insertion in model container [2024-10-24 08:59:26,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:26" (1/1) ... [2024-10-24 08:59:26,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:59:26,902 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-81.i[916,929] [2024-10-24 08:59:26,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:26,963 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:59:26,975 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-81.i[916,929] [2024-10-24 08:59:26,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:27,024 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:59:27,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27 WrapperNode [2024-10-24 08:59:27,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:27,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:27,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:59:27,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:59:27,031 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:59:27" (1/1) ... [2024-10-24 08:59:27,040 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:59:27" (1/1) ... [2024-10-24 08:59:27,065 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-24 08:59:27,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:27,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:59:27,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:59:27,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:59:27,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,105 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:59:27,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:59:27,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:59:27,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:59:27,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:59:27,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (1/1) ... [2024-10-24 08:59:27,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:27,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:59:27,166 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:59:27,178 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:59:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:59:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:59:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:59:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:59:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:59:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:59:27,290 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:59:27,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:59:27,458 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 08:59:27,458 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:59:27,526 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:59:27,527 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:59:27,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:27 BoogieIcfgContainer [2024-10-24 08:59:27,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:59:27,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:59:27,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:59:27,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:59:27,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:59:26" (1/3) ... [2024-10-24 08:59:27,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3018e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:27, skipping insertion in model container [2024-10-24 08:59:27,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:27" (2/3) ... [2024-10-24 08:59:27,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3018e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:27, skipping insertion in model container [2024-10-24 08:59:27,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:27" (3/3) ... [2024-10-24 08:59:27,534 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-24 08:59:27,546 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:59:27,547 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:59:27,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:59:27,597 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;@6a931d1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:59:27,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:59:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:59:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 08:59:27,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:27,609 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:27,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:27,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash -507814785, now seen corresponding path program 1 times [2024-10-24 08:59:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:59:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021700385] [2024-10-24 08:59:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:27,622 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:59:27,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:59:27,625 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:59:27,627 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:59:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:27,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:59:27,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:59:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-24 08:59:27,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:59:27,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:59:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021700385] [2024-10-24 08:59:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021700385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:59:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766114609] [2024-10-24 08:59:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:59:27,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:59:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:59:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:27,829 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:59:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:27,871 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2024-10-24 08:59:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:59:27,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 132 [2024-10-24 08:59:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:27,879 INFO L225 Difference]: With dead ends: 105 [2024-10-24 08:59:27,880 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 08:59:27,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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:59:27,885 INFO L432 NwaCegarLoop]: 76 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, 76 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:59:27,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:59:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 08:59:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 08:59:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 08:59:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-24 08:59:27,917 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 132 [2024-10-24 08:59:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:27,917 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-24 08:59:27,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 08:59:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-24 08:59:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 08:59:27,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:27,920 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:27,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 08:59:28,123 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:59:28,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:28,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -189098561, now seen corresponding path program 1 times [2024-10-24 08:59:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:59:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781650101] [2024-10-24 08:59:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:28,129 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:59:28,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:59:28,131 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:59:28,132 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:59:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:28,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:59:28,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:59:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 08:59:28,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:59:28,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:59:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781650101] [2024-10-24 08:59:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781650101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851419040] [2024-10-24 08:59:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:59:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:59:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:59:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:28,988 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:29,227 INFO L93 Difference]: Finished difference Result 155 states and 236 transitions. [2024-10-24 08:59:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:59:29,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 132 [2024-10-24 08:59:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:29,231 INFO L225 Difference]: With dead ends: 155 [2024-10-24 08:59:29,231 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 08:59:29,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:59:29,233 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:29,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 247 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:59:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 08:59:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2024-10-24 08:59:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 08:59:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-10-24 08:59:29,253 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 132 [2024-10-24 08:59:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-10-24 08:59:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 08:59:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-10-24 08:59:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 08:59:29,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:29,256 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:29,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:59:29,459 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:59:29,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:29,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash -737199260, now seen corresponding path program 1 times [2024-10-24 08:59:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:59:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207810594] [2024-10-24 08:59:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:29,461 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:59:29,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:59:29,462 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:59:29,468 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:59:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:29,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 08:59:29,555 INFO L278 TraceCheckSpWp]: Computing forward predicates...