./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-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:06:15,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:06:15,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:06:15,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:06:15,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:06:15,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:06:15,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:06:15,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:06:15,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:06:15,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:06:15,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:06:15,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:06:15,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:06:15,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:06:15,513 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:06:15,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:06:15,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:06:15,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:06:15,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:06:15,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:06:15,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:06:15,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:06:15,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:06:15,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:06:15,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:06:15,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:06:15,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:06:15,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:06:15,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:06:15,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:06:15,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:06:15,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:06:15,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:06:15,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:06:15,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:06:15,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:06:15,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:06:15,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:06:15,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:06:15,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:06:15,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:06:15,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:06:15,522 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-clean/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-clean/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 -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2024-10-11 13:06:15,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:06:15,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:06:15,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:06:15,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:06:15,721 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:06:15,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-10-11 13:06:17,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:06:17,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:06:17,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-10-11 13:06:17,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/df3463d30/5815c9b35bd14fc68347a0c06ff4f85b/FLAGd31f100ac [2024-10-11 13:06:17,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/df3463d30/5815c9b35bd14fc68347a0c06ff4f85b [2024-10-11 13:06:17,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:06:17,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:06:17,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:06:17,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:06:17,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:06:17,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d54cbeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17, skipping insertion in model container [2024-10-11 13:06:17,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:06:17,478 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-42.i[913,926] [2024-10-11 13:06:17,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:06:17,520 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:06:17,530 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-42.i[913,926] [2024-10-11 13:06:17,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:06:17,568 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:06:17,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17 WrapperNode [2024-10-11 13:06:17,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:06:17,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:06:17,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:06:17,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:06:17,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,648 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-11 13:06:17,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:06:17,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:06:17,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:06:17,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:06:17,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,697 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-11 13:06:17,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:06:17,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:06:17,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:06:17,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:06:17,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (1/1) ... [2024-10-11 13:06:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:06:17,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:06:17,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:06:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:06:17,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:06:17,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:06:17,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:06:17,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:06:17,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:06:17,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:06:17,886 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:06:17,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:06:18,161 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 13:06:18,164 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:06:18,195 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:06:18,196 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:06:18,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:06:18 BoogieIcfgContainer [2024-10-11 13:06:18,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:06:18,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:06:18,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:06:18,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:06:18,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:06:17" (1/3) ... [2024-10-11 13:06:18,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423452ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:06:18, skipping insertion in model container [2024-10-11 13:06:18,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:17" (2/3) ... [2024-10-11 13:06:18,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423452ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:06:18, skipping insertion in model container [2024-10-11 13:06:18,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:06:18" (3/3) ... [2024-10-11 13:06:18,212 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2024-10-11 13:06:18,230 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:06:18,231 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:06:18,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:06:18,301 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;@18c0150e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:06:18,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:06:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:06:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:06:18,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:06:18,318 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:06:18,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:06:18,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:06:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash 527235621, now seen corresponding path program 1 times [2024-10-11 13:06:18,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:06:18,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996022244] [2024-10-11 13:06:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:06:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:06:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:06:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:06:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:06:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 13:06:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:06:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 13:06:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:06:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:06:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:06:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:06:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:06:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:06:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:06:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996022244] [2024-10-11 13:06:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996022244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:06:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:06:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:06:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848494875] [2024-10-11 13:06:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:06:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:06:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:06:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:06:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:06:18,630 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:06:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:06:18,657 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2024-10-11 13:06:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:06:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 70 [2024-10-11 13:06:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:06:18,667 INFO L225 Difference]: With dead ends: 67 [2024-10-11 13:06:18,667 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 13:06:18,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-11 13:06:18,672 INFO L432 NwaCegarLoop]: 43 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, 43 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-11 13:06:18,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:06:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 13:06:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 13:06:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:06:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-11 13:06:18,702 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 70 [2024-10-11 13:06:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:06:18,702 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-11 13:06:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:06:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-11 13:06:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:06:18,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:06:18,708 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:06:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:06:18,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:06:18,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:06:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash -720905111, now seen corresponding path program 1 times [2024-10-11 13:06:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:06:18,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650963272] [2024-10-11 13:06:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:06:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:06:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:06:18,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:06:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:06:19,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:06:19,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:06:19,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:06:19,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:06:19,027 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 13:06:19,089 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:06:19,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:06:19 BoogieIcfgContainer [2024-10-11 13:06:19,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:06:19,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:06:19,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:06:19,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:06:19,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:06:18" (3/4) ... [2024-10-11 13:06:19,101 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:06:19,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:06:19,102 INFO L158 Benchmark]: Toolchain (without parser) took 1800.98ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 111.8MB in the beginning and 217.0MB in the end (delta: -105.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:06:19,103 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 135.2MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:06:19,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.39ms. Allocated memory is still 184.5MB. Free memory was 111.6MB in the beginning and 152.3MB in the end (delta: -40.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 13:06:19,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.41ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 149.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:06:19,104 INFO L158 Benchmark]: Boogie Preprocessor took 75.70ms. Allocated memory is still 184.5MB. Free memory was 149.5MB in the beginning and 150.6MB in the end (delta: -1.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-10-11 13:06:19,105 INFO L158 Benchmark]: RCFGBuilder took 470.17ms. Allocated memory is still 184.5MB. Free memory was 150.6MB in the beginning and 132.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:06:19,107 INFO L158 Benchmark]: TraceAbstraction took 895.15ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 131.8MB in the beginning and 218.0MB in the end (delta: -86.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:06:19,107 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 264.2MB. Free memory is still 217.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:06:19,109 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.19ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 135.2MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.39ms. Allocated memory is still 184.5MB. Free memory was 111.6MB in the beginning and 152.3MB in the end (delta: -40.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.41ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 149.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.70ms. Allocated memory is still 184.5MB. Free memory was 149.5MB in the beginning and 150.6MB in the end (delta: -1.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * RCFGBuilder took 470.17ms. Allocated memory is still 184.5MB. Free memory was 150.6MB in the beginning and 132.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 895.15ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 131.8MB in the beginning and 218.0MB in the end (delta: -86.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 264.2MB. Free memory is still 217.0MB. 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 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L23] unsigned char var_1_8 = 5; [L24] unsigned char var_1_9 = 4; [L25] float var_1_10 = 16.5; [L26] float var_1_11 = 127.25; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 0; [L29] unsigned char var_1_15 = 0; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L63] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L63] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L64] var_1_11 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L65] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L66] var_1_13 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L67] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L70] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L72] var_1_16 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L75] var_1_18 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L76] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_8 = (var_1_9 + 100) [L37] var_1_10 = ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=227, var_1_9=127] [L38] COND FALSE !(var_1_8 > var_1_8) [L41] var_1_1 = (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8)))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L43] COND FALSE !(var_1_11 <= var_1_10) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L48] COND TRUE var_1_8 <= 1000000 [L49] var_1_17 = 0 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L54] COND TRUE (- var_1_10) > var_1_11 [L55] var_1_12 = (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return (((((var_1_8 > var_1_8) ? (var_1_1 == ((signed long int) (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) - 10))) : (var_1_1 == ((signed long int) (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8))))))) && (var_1_8 == ((unsigned char) (var_1_9 + 100)))) && (var_1_10 == ((float) ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f)))))) && (((- var_1_10) > var_1_11) ? (var_1_12 == ((unsigned char) (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))))) : (var_1_12 == ((unsigned char) ((var_1_1 <= var_1_9) && var_1_16))))) && ((var_1_11 <= var_1_10) ? ((var_1_1 != var_1_8) ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : ((var_1_8 <= 1000000) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0)))) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 43 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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-11 13:06:19,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:06:21,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:06:21,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:06:21,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:06:21,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:06:21,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:06:21,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:06:21,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:06:21,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:06:21,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:06:21,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:06:21,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:06:21,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:06:21,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:06:21,167 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:06:21,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:06:21,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:06:21,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:06:21,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:06:21,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:06:21,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:06:21,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:06:21,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:06:21,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:06:21,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:06:21,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:06:21,171 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:06:21,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:06:21,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:06:21,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:06:21,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:06:21,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:06:21,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:06:21,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:06:21,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:06:21,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:06:21,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:06:21,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:06:21,175 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:06:21,175 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-clean/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-clean/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 -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2024-10-11 13:06:21,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:06:21,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:06:21,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:06:21,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:06:21,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:06:21,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-10-11 13:06:23,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:06:23,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:06:23,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-10-11 13:06:23,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6efd0e503/5e51660a73d34306b2c279bfdd2a3389/FLAG8fca8649f [2024-10-11 13:06:23,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6efd0e503/5e51660a73d34306b2c279bfdd2a3389 [2024-10-11 13:06:23,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:06:23,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:06:23,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:06:23,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:06:23,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:06:23,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da52819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23, skipping insertion in model container [2024-10-11 13:06:23,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:06:23,449 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-42.i[913,926] [2024-10-11 13:06:23,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:06:23,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:06:23,536 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-42.i[913,926] [2024-10-11 13:06:23,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:06:23,576 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:06:23,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23 WrapperNode [2024-10-11 13:06:23,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:06:23,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:06:23,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:06:23,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:06:23,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,612 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-11 13:06:23,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:06:23,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:06:23,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:06:23,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:06:23,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,644 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-11 13:06:23,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:06:23,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:06:23,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:06:23,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:06:23,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (1/1) ... [2024-10-11 13:06:23,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:06:23,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:06:23,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:06:23,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:06:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:06:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:06:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:06:23,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:06:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:06:23,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:06:23,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:06:23,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:06:23,962 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 13:06:23,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:06:24,025 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:06:24,026 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:06:24,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:06:24 BoogieIcfgContainer [2024-10-11 13:06:24,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:06:24,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:06:24,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:06:24,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:06:24,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:06:23" (1/3) ... [2024-10-11 13:06:24,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbace2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:06:24, skipping insertion in model container [2024-10-11 13:06:24,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:06:23" (2/3) ... [2024-10-11 13:06:24,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbace2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:06:24, skipping insertion in model container [2024-10-11 13:06:24,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:06:24" (3/3) ... [2024-10-11 13:06:24,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2024-10-11 13:06:24,046 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:06:24,046 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:06:24,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:06:24,153 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;@64e080b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:06:24,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:06:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:06:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:06:24,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:06:24,168 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:06:24,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:06:24,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:06:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 527235621, now seen corresponding path program 1 times [2024-10-11 13:06:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:06:24,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322089596] [2024-10-11 13:06:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:06:24,183 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-11 13:06:24,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:06:24,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:06:24,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:06:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:24,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:06:24,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:06:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:06:24,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:06:24,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:06:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322089596] [2024-10-11 13:06:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322089596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:06:24,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:06:24,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:06:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055802821] [2024-10-11 13:06:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:06:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:06:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:06:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:06:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:06:24,376 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:06:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:06:24,429 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2024-10-11 13:06:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:06:24,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-11 13:06:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:06:24,440 INFO L225 Difference]: With dead ends: 67 [2024-10-11 13:06:24,440 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 13:06:24,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-11 13:06:24,447 INFO L432 NwaCegarLoop]: 43 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, 43 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-11 13:06:24,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:06:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 13:06:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 13:06:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:06:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-11 13:06:24,483 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 70 [2024-10-11 13:06:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:06:24,484 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-11 13:06:24,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:06:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-11 13:06:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:06:24,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:06:24,487 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:06:24,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:06:24,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:06:24,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:06:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:06:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -720905111, now seen corresponding path program 1 times [2024-10-11 13:06:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:06:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393843398] [2024-10-11 13:06:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:06:24,691 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-11 13:06:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:06:24,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:06:24,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:06:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:24,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:06:24,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:06:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 13:06:25,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:06:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:06:52,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:06:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393843398] [2024-10-11 13:06:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393843398] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:06:52,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:06:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-10-11 13:06:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058934464] [2024-10-11 13:06:52,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:06:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:06:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:06:52,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:06:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:06:52,990 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:06:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:06:53,885 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-11 13:06:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:06:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-11 13:06:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:06:53,888 INFO L225 Difference]: With dead ends: 50 [2024-10-11 13:06:53,892 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 13:06:53,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:06:53,894 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:06:53,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 134 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:06:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 13:06:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2024-10-11 13:06:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:06:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-10-11 13:06:53,915 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 70 [2024-10-11 13:06:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:06:53,915 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-10-11 13:06:53,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:06:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-10-11 13:06:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:06:53,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:06:53,916 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:06:53,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:06:54,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:06:54,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:06:54,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:06:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -720845529, now seen corresponding path program 1 times [2024-10-11 13:06:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:06:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475301352] [2024-10-11 13:06:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:06:54,123 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-11 13:06:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:06:54,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:06:54,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:06:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:06:54,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 13:06:54,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:07:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 13:07:15,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:07:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:07:32,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:07:32,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475301352] [2024-10-11 13:07:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475301352] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:07:32,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:07:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-10-11 13:07:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794436879] [2024-10-11 13:07:32,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:07:32,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:07:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:07:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:07:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:07:32,957 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:07:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:07:33,552 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-10-11 13:07:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:07:33,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-11 13:07:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:07:33,555 INFO L225 Difference]: With dead ends: 53 [2024-10-11 13:07:33,555 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 13:07:33,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:07:33,556 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:07:33,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:07:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 13:07:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-10-11 13:07:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:07:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-10-11 13:07:33,573 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 70 [2024-10-11 13:07:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:07:33,574 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-10-11 13:07:33,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:07:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-10-11 13:07:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:07:33,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:07:33,579 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:07:33,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:07:33,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:07:33,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:07:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:07:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -957326487, now seen corresponding path program 1 times [2024-10-11 13:07:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:07:33,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272103642] [2024-10-11 13:07:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:07:33,784 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-11 13:07:33,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:07:33,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:07:33,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:07:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:07:33,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:07:33,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:07:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 13:07:47,309 INFO L311 TraceCheckSpWp]: Computing backward predicates...