./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_variablewrapping_normal_file-14.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_variablewrapping_normal_file-14.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 f3bccbd47f020014aaa87680c2199640dac67db437f4e10374d3a460fe0987cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:02:10,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:02:10,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:02:10,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:02:10,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:02:10,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:02:10,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:02:10,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:02:10,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:02:10,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:02:10,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:02:10,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:02:10,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:02:10,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:02:10,564 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:02:10,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:02:10,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:02:10,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:02:10,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:02:10,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:02:10,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:02:10,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:02:10,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:02:10,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:02:10,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:02:10,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:02:10,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:02:10,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:02:10,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:02:10,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:02:10,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:02:10,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:02:10,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:10,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:02:10,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:02:10,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:02:10,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:02:10,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:02:10,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:02:10,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:02:10,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:02:10,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:02:10,572 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 -> f3bccbd47f020014aaa87680c2199640dac67db437f4e10374d3a460fe0987cf [2024-10-24 11:02:10,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:02:10,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:02:10,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:02:10,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:02:10,813 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:02:10,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-14.i [2024-10-24 11:02:12,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:02:12,297 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:02:12,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-14.i [2024-10-24 11:02:12,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fc77e7c/09c6418521194f2582a3caadd4a5623b/FLAG41d3aa1de [2024-10-24 11:02:12,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fc77e7c/09c6418521194f2582a3caadd4a5623b [2024-10-24 11:02:12,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:02:12,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:02:12,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:12,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:02:12,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:02:12,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:12" (1/1) ... [2024-10-24 11:02:12,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378a94a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:12, skipping insertion in model container [2024-10-24 11:02:12,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:12" (1/1) ... [2024-10-24 11:02:12,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:02:12,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_variablewrapping_normal_file-14.i[913,926] [2024-10-24 11:02:12,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:12,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:02:12,966 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_variablewrapping_normal_file-14.i[913,926] [2024-10-24 11:02:12,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:13,006 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:02:13,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13 WrapperNode [2024-10-24 11:02:13,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:13,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:13,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:02:13,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:02:13,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,054 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-24 11:02:13,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:13,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:02:13,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:02:13,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:02:13,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,111 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 11:02:13,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:02:13,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:02:13,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:02:13,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:02:13,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (1/1) ... [2024-10-24 11:02:13,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:13,191 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 11:02:13,196 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 11:02:13,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:02:13,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:02:13,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:02:13,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:02:13,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:02:13,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:02:13,313 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:02:13,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:02:13,573 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:02:13,574 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:02:13,613 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:02:13,614 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:02:13,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:13 BoogieIcfgContainer [2024-10-24 11:02:13,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:02:13,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:02:13,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:02:13,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:02:13,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:02:12" (1/3) ... [2024-10-24 11:02:13,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467f015b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:13, skipping insertion in model container [2024-10-24 11:02:13,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:13" (2/3) ... [2024-10-24 11:02:13,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467f015b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:13, skipping insertion in model container [2024-10-24 11:02:13,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:13" (3/3) ... [2024-10-24 11:02:13,626 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-14.i [2024-10-24 11:02:13,641 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:02:13,641 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:02:13,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:02:13,705 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;@49b5426c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:02:13,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:02:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:02:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:13,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:13,720 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:13,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 175034516, now seen corresponding path program 1 times [2024-10-24 11:02:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796912826] [2024-10-24 11:02:13,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:02:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:02:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:02:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:02:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:02:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:02:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:02:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:02:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:02:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:02:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 11:02:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:02:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 11:02:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 11:02:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 11:02:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:02:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:02:14,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:14,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796912826] [2024-10-24 11:02:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796912826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:02:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228323154] [2024-10-24 11:02:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:14,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:02:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:14,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:02:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:14,045 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:02:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:14,094 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2024-10-24 11:02:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:02:14,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2024-10-24 11:02:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:14,103 INFO L225 Difference]: With dead ends: 101 [2024-10-24 11:02:14,105 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 11:02:14,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 11:02:14,113 INFO L432 NwaCegarLoop]: 72 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, 72 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 11:02:14,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:02:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 11:02:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-24 11:02:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:02:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-24 11:02:14,161 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 127 [2024-10-24 11:02:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:14,161 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-24 11:02:14,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:02:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-24 11:02:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:14,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:14,170 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:14,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:02:14,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:14,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1339866646, now seen corresponding path program 1 times [2024-10-24 11:02:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:14,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376507097] [2024-10-24 11:02:14,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:14,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:02:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:02:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:02:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:02:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:02:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:02:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:02:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:02:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:02:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:02:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 11:02:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:02:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 11:02:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 11:02:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 11:02:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:02:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:02:14,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376507097] [2024-10-24 11:02:14,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376507097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:14,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:02:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913248637] [2024-10-24 11:02:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:14,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:02:14,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:14,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:02:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:02:14,730 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:02:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:14,873 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2024-10-24 11:02:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:02:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 127 [2024-10-24 11:02:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:14,876 INFO L225 Difference]: With dead ends: 149 [2024-10-24 11:02:14,876 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:02:14,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 11:02:14,878 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:14,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 208 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:02:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:02:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2024-10-24 11:02:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:02:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 134 transitions. [2024-10-24 11:02:14,893 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 134 transitions. Word has length 127 [2024-10-24 11:02:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:14,894 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 134 transitions. [2024-10-24 11:02:14,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:02:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 134 transitions. [2024-10-24 11:02:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:14,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:14,895 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:14,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:02:14,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:14,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash 530520020, now seen corresponding path program 1 times [2024-10-24 11:02:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384787440] [2024-10-24 11:02:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:02:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:02:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:02:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:02:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:02:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:02:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:02:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:02:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 11:02:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:02:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 11:02:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 11:02:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 11:02:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 11:02:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 11:02:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:02:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 11:02:15,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384787440] [2024-10-24 11:02:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384787440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:02:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87649041] [2024-10-24 11:02:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:02:15,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:15,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:02:15,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:02:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:15,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:02:15,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 11:02:15,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:02:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 11:02:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87649041] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:02:15,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:02:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-10-24 11:02:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113287433] [2024-10-24 11:02:15,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:02:15,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:02:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:02:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:02:15,892 INFO L87 Difference]: Start difference. First operand 89 states and 134 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 11:02:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:16,111 INFO L93 Difference]: Finished difference Result 150 states and 218 transitions. [2024-10-24 11:02:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:02:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 127 [2024-10-24 11:02:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:16,114 INFO L225 Difference]: With dead ends: 150 [2024-10-24 11:02:16,114 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:02:16,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:02:16,115 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 136 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:16,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 109 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:02:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:02:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-10-24 11:02:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:02:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-10-24 11:02:16,140 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 127 [2024-10-24 11:02:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:16,144 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-10-24 11:02:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 11:02:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-10-24 11:02:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:16,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:16,145 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:16,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:02:16,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:02:16,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 530579602, now seen corresponding path program 1 times [2024-10-24 11:02:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702301704] [2024-10-24 11:02:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:02:16,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:02:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:02:16,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:02:16,455 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:02:16,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:02:16,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:02:16,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:02:16,543 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:02:16,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:02:16 BoogieIcfgContainer [2024-10-24 11:02:16,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:02:16,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:02:16,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:02:16,547 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:02:16,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:13" (3/4) ... [2024-10-24 11:02:16,549 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:02:16,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:02:16,551 INFO L158 Benchmark]: Toolchain (without parser) took 3850.35ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 82.6MB in the beginning and 110.3MB in the end (delta: -27.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-10-24 11:02:16,551 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:02:16,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.67ms. Allocated memory is still 138.4MB. Free memory was 82.6MB in the beginning and 67.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:02:16,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.28ms. Allocated memory is still 138.4MB. Free memory was 67.9MB in the beginning and 65.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:02:16,552 INFO L158 Benchmark]: Boogie Preprocessor took 78.82ms. Allocated memory is still 138.4MB. Free memory was 65.0MB in the beginning and 61.1MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:02:16,554 INFO L158 Benchmark]: RCFGBuilder took 464.46ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 110.3MB in the beginning and 140.5MB in the end (delta: -30.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-24 11:02:16,554 INFO L158 Benchmark]: TraceAbstraction took 2929.88ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 111.4MB in the end (delta: 28.1MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-10-24 11:02:16,555 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 186.6MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:02:16,556 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 138.4MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.67ms. Allocated memory is still 138.4MB. Free memory was 82.6MB in the beginning and 67.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.28ms. Allocated memory is still 138.4MB. Free memory was 67.9MB in the beginning and 65.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.82ms. Allocated memory is still 138.4MB. Free memory was 65.0MB in the beginning and 61.1MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.46ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 110.3MB in the beginning and 140.5MB in the end (delta: -30.2MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2929.88ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 111.4MB in the end (delta: 28.1MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 186.6MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed short int var_1_5 = -64; [L26] signed short int var_1_6 = -64; [L27] signed short int var_1_7 = 10; [L28] signed short int var_1_8 = 8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] unsigned short int var_1_12 = 2; [L33] float var_1_13 = 32.25; [L34] float var_1_14 = 15.5; [L35] float var_1_15 = 256.25; [L36] double var_1_16 = 8.6; [L37] unsigned short int var_1_17 = 57581; [L38] unsigned char last_1_var_1_9 = 0; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 [L112] RET updateLastVariables() [L113] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=10, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=10, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=10, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=10, var_1_8=8, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=8, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_short() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L93] var_1_15 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L42] COND FALSE !(\read(last_1_var_1_9)) [L45] var_1_5 = ((var_1_7 + 16) - var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L47] COND FALSE !((var_1_13 / var_1_14) <= var_1_15) [L54] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L56] COND TRUE ((var_1_5 >= var_1_12) && var_1_2) && var_1_3 [L57] var_1_9 = (! var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L61] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L62] COND FALSE !(stepLocal_0 && var_1_9) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_9 && var_1_9) ? (var_1_1 == ((signed long int) var_1_5)) : 1) && (last_1_var_1_9 ? (var_1_5 == ((signed short int) var_1_6)) : (var_1_5 == ((signed short int) ((var_1_7 + 16) - var_1_8))))) && ((((var_1_5 >= var_1_12) && var_1_2) && var_1_3) ? (var_1_9 == ((unsigned char) (! var_1_10))) : (var_1_9 == ((unsigned char) (! (var_1_11 || var_1_10)))))) && (((var_1_13 / var_1_14) <= var_1_15) ? (((var_1_16 - 2.3) > var_1_14) ? (var_1_12 == ((unsigned short int) (var_1_17 - var_1_7))) : (var_1_12 == ((unsigned short int) ((((var_1_7) > (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))) ? (var_1_7) : (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))))))) : (var_1_12 == ((unsigned short int) var_1_8))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_17=-1073643521, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=32766, var_1_7=16383, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 389 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 187 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 1 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4110/4200 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 11:02:16,586 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_variablewrapping_normal_file-14.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 f3bccbd47f020014aaa87680c2199640dac67db437f4e10374d3a460fe0987cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:02:18,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:02:18,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:02:18,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:02:18,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:02:18,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:02:18,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:02:18,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:02:18,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:02:18,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:02:18,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:02:18,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:02:18,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:02:18,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:02:18,615 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:02:18,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:02:18,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:02:18,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:02:18,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:02:18,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:02:18,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:02:18,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:02:18,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:02:18,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:02:18,618 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:02:18,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:02:18,619 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:02:18,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:02:18,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:02:18,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:02:18,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:02:18,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:02:18,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:02:18,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:02:18,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:18,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:02:18,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:02:18,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:02:18,622 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:02:18,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:02:18,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:02:18,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:02:18,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:02:18,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:02:18,623 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:02:18,623 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 -> f3bccbd47f020014aaa87680c2199640dac67db437f4e10374d3a460fe0987cf [2024-10-24 11:02:18,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:02:18,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:02:18,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:02:18,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:02:18,915 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:02:18,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-14.i [2024-10-24 11:02:20,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:02:20,547 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:02:20,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-14.i [2024-10-24 11:02:20,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c69e8794/3bdd87d853ac40a68c385fa3be8e2fd2/FLAG19248246c [2024-10-24 11:02:20,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c69e8794/3bdd87d853ac40a68c385fa3be8e2fd2 [2024-10-24 11:02:20,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:02:20,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:02:20,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:20,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:02:20,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:02:20,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:20,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a895535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20, skipping insertion in model container [2024-10-24 11:02:20,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:20,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:02:20,799 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_variablewrapping_normal_file-14.i[913,926] [2024-10-24 11:02:20,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:20,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:02:20,895 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_variablewrapping_normal_file-14.i[913,926] [2024-10-24 11:02:20,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:20,953 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:02:20,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20 WrapperNode [2024-10-24 11:02:20,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:20,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:20,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:02:20,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:02:20,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:20,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,010 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-24 11:02:21,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:21,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:02:21,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:02:21,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:02:21,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,043 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 11:02:21,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:02:21,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:02:21,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:02:21,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:02:21,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (1/1) ... [2024-10-24 11:02:21,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:21,103 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 11:02:21,109 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 11:02:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:02:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:02:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:02:21,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:02:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:02:21,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:02:21,254 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:02:21,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:02:24,651 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:02:24,651 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:02:24,701 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:02:24,702 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:02:24,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:24 BoogieIcfgContainer [2024-10-24 11:02:24,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:02:24,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:02:24,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:02:24,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:02:24,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:02:20" (1/3) ... [2024-10-24 11:02:24,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88581e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:24, skipping insertion in model container [2024-10-24 11:02:24,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:20" (2/3) ... [2024-10-24 11:02:24,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88581e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:24, skipping insertion in model container [2024-10-24 11:02:24,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:24" (3/3) ... [2024-10-24 11:02:24,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-14.i [2024-10-24 11:02:24,719 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:02:24,719 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:02:24,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:02:24,768 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;@d5544c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:02:24,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:02:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:02:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:24,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:24,787 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:24,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:24,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 175034516, now seen corresponding path program 1 times [2024-10-24 11:02:24,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:24,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616063634] [2024-10-24 11:02:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:24,805 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 11:02:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:24,811 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 11:02:24,812 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 11:02:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:25,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:02:25,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-24 11:02:25,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:02:25,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616063634] [2024-10-24 11:02:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616063634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:02:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001286441] [2024-10-24 11:02:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:25,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:02:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:02:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:25,234 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:02:27,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:27,048 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2024-10-24 11:02:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:02:27,072 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 127 [2024-10-24 11:02:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:27,077 INFO L225 Difference]: With dead ends: 101 [2024-10-24 11:02:27,077 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 11:02:27,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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 11:02:27,081 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:27,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 11:02:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 11:02:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-24 11:02:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 11:02:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-24 11:02:27,137 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 127 [2024-10-24 11:02:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:27,137 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-24 11:02:27,137 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 11:02:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-24 11:02:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:27,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:27,140 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:27,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:02:27,344 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 11:02:27,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1339866646, now seen corresponding path program 1 times [2024-10-24 11:02:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520902735] [2024-10-24 11:02:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:27,347 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 11:02:27,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:27,350 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 11:02:27,351 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 11:02:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:27,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:02:27,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 11:02:28,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:02:28,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520902735] [2024-10-24 11:02:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520902735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:28,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:02:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531586901] [2024-10-24 11:02:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:02:28,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:02:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:02:28,603 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:02:30,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:32,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:32,786 INFO L93 Difference]: Finished difference Result 152 states and 230 transitions. [2024-10-24 11:02:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:02:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 127 [2024-10-24 11:02:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:32,813 INFO L225 Difference]: With dead ends: 152 [2024-10-24 11:02:32,813 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:02:32,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:02:32,815 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 42 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:32,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 212 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 11:02:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:02:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-10-24 11:02:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:02:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 134 transitions. [2024-10-24 11:02:32,833 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 134 transitions. Word has length 127 [2024-10-24 11:02:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 134 transitions. [2024-10-24 11:02:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 11:02:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 134 transitions. [2024-10-24 11:02:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:32,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:32,835 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:32,845 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 11:02:33,039 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 11:02:33,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:33,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash 530520020, now seen corresponding path program 1 times [2024-10-24 11:02:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685125702] [2024-10-24 11:02:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:33,042 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 11:02:33,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:33,044 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 11:02:33,062 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 11:02:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:02:33,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 11:02:33,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:02:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 11:02:34,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685125702] [2024-10-24 11:02:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685125702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:02:34,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:02:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-24 11:02:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980549225] [2024-10-24 11:02:34,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:02:34,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:02:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:02:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:02:34,327 INFO L87 Difference]: Start difference. First operand 89 states and 134 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 11:02:36,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:02:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:36,577 INFO L93 Difference]: Finished difference Result 150 states and 218 transitions. [2024-10-24 11:02:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:02:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 127 [2024-10-24 11:02:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:36,634 INFO L225 Difference]: With dead ends: 150 [2024-10-24 11:02:36,636 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:02:36,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:02:36,637 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 89 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:36,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 88 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 11:02:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:02:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-10-24 11:02:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 11:02:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-10-24 11:02:36,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 127 [2024-10-24 11:02:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:36,662 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-10-24 11:02:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 11:02:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-10-24 11:02:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:02:36,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:36,665 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:36,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:02:36,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:36,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:36,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash 530579602, now seen corresponding path program 1 times [2024-10-24 11:02:36,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:36,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073689490] [2024-10-24 11:02:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:36,868 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 11:02:36,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:36,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:36,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:02:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:37,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:02:37,130 INFO L278 TraceCheckSpWp]: Computing forward predicates...