./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-2.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-2.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 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:03:25,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:03:25,184 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:03:25,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:03:25,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:03:25,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:03:25,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:03:25,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:03:25,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:03:25,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:03:25,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:03:25,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:03:25,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:03:25,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:03:25,235 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:03:25,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:03:25,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:03:25,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:03:25,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:03:25,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:03:25,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:03:25,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:03:25,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:03:25,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:03:25,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:03:25,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:03:25,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:03:25,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:03:25,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:03:25,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:03:25,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:03:25,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:03:25,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:03:25,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:03:25,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:03:25,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:03:25,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:03:25,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:03:25,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:03:25,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:03:25,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:03:25,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:03:25,250 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 -> 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 [2024-10-11 13:03:25,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:03:25,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:03:25,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:03:25,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:03:25,539 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:03:25,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-10-11 13:03:27,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:03:27,232 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:03:27,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-10-11 13:03:27,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/832a8fa51/4f62fdbc7e6e46668de2ef1ec456722c/FLAG225a88f4b [2024-10-11 13:03:27,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/832a8fa51/4f62fdbc7e6e46668de2ef1ec456722c [2024-10-11 13:03:27,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:03:27,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:03:27,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:03:27,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:03:27,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:03:27,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41087f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27, skipping insertion in model container [2024-10-11 13:03:27,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:03:27,471 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-2.i[912,925] [2024-10-11 13:03:27,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:03:27,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:03:27,565 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-2.i[912,925] [2024-10-11 13:03:27,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:03:27,627 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:03:27,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27 WrapperNode [2024-10-11 13:03:27,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:03:27,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:03:27,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:03:27,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:03:27,640 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:03:27" (1/1) ... [2024-10-11 13:03:27,651 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:03:27" (1/1) ... [2024-10-11 13:03:27,690 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-11 13:03:27,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:03:27,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:03:27,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:03:27,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:03:27,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,729 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:03:27,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:03:27,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:03:27,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:03:27,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:03:27,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (1/1) ... [2024-10-11 13:03:27,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:03:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:03:27,792 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:03:27,795 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:03:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:03:27,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:03:27,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:03:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:03:27,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:03:27,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:03:27,923 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:03:27,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:03:28,216 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 13:03:28,216 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:03:28,248 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:03:28,249 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:03:28,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:03:28 BoogieIcfgContainer [2024-10-11 13:03:28,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:03:28,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:03:28,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:03:28,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:03:28,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:03:27" (1/3) ... [2024-10-11 13:03:28,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcc7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:03:28, skipping insertion in model container [2024-10-11 13:03:28,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:27" (2/3) ... [2024-10-11 13:03:28,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcc7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:03:28, skipping insertion in model container [2024-10-11 13:03:28,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:03:28" (3/3) ... [2024-10-11 13:03:28,263 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-2.i [2024-10-11 13:03:28,281 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:03:28,281 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:03:28,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:03:28,358 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;@21915213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:03:28,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:03:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:03:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 13:03:28,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:03:28,375 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:03:28,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:03:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1277455852, now seen corresponding path program 1 times [2024-10-11 13:03:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:03:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641042920] [2024-10-11 13:03:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:03:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:03:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:03:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:03:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:03:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:03:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:03:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:03:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:03:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:03:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:03:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:03:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 13:03:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:03:28,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:03:28,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641042920] [2024-10-11 13:03:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641042920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:03:28,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:03:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:03:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697209747] [2024-10-11 13:03:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:03:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:03:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:03:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:03:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:03:28,907 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:03:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:03:28,948 INFO L93 Difference]: Finished difference Result 89 states and 150 transitions. [2024-10-11 13:03:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:03:28,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-11 13:03:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:03:28,961 INFO L225 Difference]: With dead ends: 89 [2024-10-11 13:03:28,962 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 13:03:28,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:03:28,969 INFO L432 NwaCegarLoop]: 59 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, 59 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:03:28,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:03:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 13:03:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 13:03:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:03:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2024-10-11 13:03:29,017 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 77 [2024-10-11 13:03:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:03:29,017 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2024-10-11 13:03:29,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:03:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2024-10-11 13:03:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 13:03:29,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:03:29,022 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:03:29,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:03:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:03:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -539372632, now seen corresponding path program 1 times [2024-10-11 13:03:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:03:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459258545] [2024-10-11 13:03:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:03:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:03:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:03:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:03:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:03:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:03:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:03:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:03:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:03:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:03:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:03:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:03:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 13:03:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:03:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:03:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459258545] [2024-10-11 13:03:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459258545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:03:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:03:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:03:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773097642] [2024-10-11 13:03:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:03:30,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:03:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:03:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:03:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:03:30,078 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:03:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:03:30,625 INFO L93 Difference]: Finished difference Result 103 states and 148 transitions. [2024-10-11 13:03:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:03:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-11 13:03:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:03:30,629 INFO L225 Difference]: With dead ends: 103 [2024-10-11 13:03:30,629 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 13:03:30,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:03:30,634 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:03:30,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 123 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:03:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 13:03:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-10-11 13:03:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:03:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-10-11 13:03:30,651 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 77 [2024-10-11 13:03:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:03:30,654 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-10-11 13:03:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:03:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-10-11 13:03:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 13:03:30,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:03:30,658 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:30,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:03:30,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:03:30,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:03:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1348719258, now seen corresponding path program 1 times [2024-10-11 13:03:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:03:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390841348] [2024-10-11 13:03:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:03:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:03:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:03:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:03:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:03:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:03:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:03:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:03:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:03:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:03:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:03:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:03:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 13:03:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:03:30,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:03:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390841348] [2024-10-11 13:03:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390841348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:03:30,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:03:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:03:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218593917] [2024-10-11 13:03:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:03:30,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:03:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:03:30,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:03:30,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:03:30,890 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:03:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:03:31,090 INFO L93 Difference]: Finished difference Result 111 states and 160 transitions. [2024-10-11 13:03:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:03:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-11 13:03:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:03:31,096 INFO L225 Difference]: With dead ends: 111 [2024-10-11 13:03:31,096 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 13:03:31,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:03:31,099 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 21 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:03:31,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 207 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:03:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 13:03:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2024-10-11 13:03:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:03:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-10-11 13:03:31,114 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 77 [2024-10-11 13:03:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:03:31,115 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-10-11 13:03:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:03:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-10-11 13:03:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 13:03:31,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:03:31,119 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:03:31,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:03:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:03:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 809771959, now seen corresponding path program 1 times [2024-10-11 13:03:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:03:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049785898] [2024-10-11 13:03:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:03:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:03:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606583735] [2024-10-11 13:03:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:31,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:03:31,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:03:31,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:03:31,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:03:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:03:31,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:03:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:03:31,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:03:31,397 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:03:31,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:03:31,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:03:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:03:31,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:03:31,657 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:03:31,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:03:31 BoogieIcfgContainer [2024-10-11 13:03:31,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:03:31,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:03:31,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:03:31,662 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:03:31,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:03:28" (3/4) ... [2024-10-11 13:03:31,665 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:03:31,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:03:31,666 INFO L158 Benchmark]: Toolchain (without parser) took 4401.58ms. Allocated memory was 165.7MB in the beginning and 247.5MB in the end (delta: 81.8MB). Free memory was 110.8MB in the beginning and 193.3MB in the end (delta: -82.5MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-10-11 13:03:31,669 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 165.7MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:03:31,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.25ms. Allocated memory is still 165.7MB. Free memory was 110.7MB in the beginning and 96.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:03:31,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.76ms. Allocated memory is still 165.7MB. Free memory was 96.5MB in the beginning and 92.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:03:31,670 INFO L158 Benchmark]: Boogie Preprocessor took 57.90ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 88.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:03:31,670 INFO L158 Benchmark]: RCFGBuilder took 499.92ms. Allocated memory is still 165.7MB. Free memory was 88.2MB in the beginning and 65.9MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 13:03:31,671 INFO L158 Benchmark]: TraceAbstraction took 3405.89ms. Allocated memory was 165.7MB in the beginning and 247.5MB in the end (delta: 81.8MB). Free memory was 65.5MB in the beginning and 193.3MB in the end (delta: -127.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:03:31,671 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 247.5MB. Free memory is still 193.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:03:31,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 165.7MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.25ms. Allocated memory is still 165.7MB. Free memory was 110.7MB in the beginning and 96.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.76ms. Allocated memory is still 165.7MB. Free memory was 96.5MB in the beginning and 92.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.90ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 88.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 499.92ms. Allocated memory is still 165.7MB. Free memory was 88.2MB in the beginning and 65.9MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3405.89ms. Allocated memory was 165.7MB in the beginning and 247.5MB in the end (delta: 81.8MB). Free memory was 65.5MB in the beginning and 193.3MB in the end (delta: -127.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 247.5MB. Free memory is still 193.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someUnaryDOUBLEoperation at line 29. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int var_1_5 = 200; [L24] unsigned short int var_1_6 = 56955; [L25] unsigned short int var_1_7 = 32; [L26] unsigned short int var_1_8 = 1; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 1; [L29] float var_1_11 = -0.6; [L30] float var_1_12 = 9.125; [L31] float var_1_13 = 50.5; [L32] unsigned short int last_1_var_1_1 = 10; [L33] unsigned short int last_1_var_1_9 = 8; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_1 = var_1_1 [L86] last_1_var_1_9 = var_1_9 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L66] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L66] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L67] var_1_6 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L68] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L69] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L69] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L70] var_1_7 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L71] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=1, var_1_9=8] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=1, var_1_9=8] [L73] var_1_8 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_9=8] [L74] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L75] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L76] var_1_10 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L77] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L78] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L79] var_1_12 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L80] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L81] var_1_13 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L82] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L97] RET updateVariables() [L98] CALL step() [L37] COND TRUE last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1) [L38] var_1_1 = ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=8] [L40] COND FALSE !(var_1_10 || (var_1_6 == var_1_8)) [L51] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L53] COND FALSE !(var_1_7 != var_1_6) [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L89] EXPR (var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6)) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L89] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L89-L90] return (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6)))) && ((var_1_7 != var_1_6) ? ((var_1_7 <= var_1_9) ? (var_1_11 == ((float) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((float) var_1_12))) : (var_1_11 == ((float) var_1_12))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=32767, var_1_8=32768, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 389 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 183 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 942 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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:03:31,697 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-2.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 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:03:34,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:03:34,114 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:03:34,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:03:34,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:03:34,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:03:34,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:03:34,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:03:34,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:03:34,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:03:34,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:03:34,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:03:34,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:03:34,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:03:34,161 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:03:34,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:03:34,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:03:34,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:03:34,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:03:34,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:03:34,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:03:34,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:03:34,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:03:34,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:03:34,166 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:03:34,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:03:34,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:03:34,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:03:34,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:03:34,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:03:34,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:03:34,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:03:34,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:03:34,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:03:34,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:03:34,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:03:34,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:03:34,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:03:34,171 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:03:34,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:03:34,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:03:34,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:03:34,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:03:34,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:03:34,172 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:03:34,172 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 -> 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 [2024-10-11 13:03:34,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:03:34,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:03:34,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:03:34,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:03:34,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:03:34,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-10-11 13:03:36,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:03:36,469 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:03:36,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-10-11 13:03:36,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/044aa99c8/0b4f725ea9f34e51ac41ab2ecb688cf9/FLAG5d7ba62cd [2024-10-11 13:03:36,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/044aa99c8/0b4f725ea9f34e51ac41ab2ecb688cf9 [2024-10-11 13:03:36,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:03:36,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:03:36,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:03:36,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:03:36,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:03:36,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:03:36" (1/1) ... [2024-10-11 13:03:36,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac47681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:36, skipping insertion in model container [2024-10-11 13:03:36,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:03:36" (1/1) ... [2024-10-11 13:03:36,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:03:37,057 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-2.i[912,925] [2024-10-11 13:03:37,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:03:37,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:03:37,156 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-2.i[912,925] [2024-10-11 13:03:37,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:03:37,214 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:03:37,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37 WrapperNode [2024-10-11 13:03:37,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:03:37,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:03:37,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:03:37,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:03:37,224 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:03:37" (1/1) ... [2024-10-11 13:03:37,240 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:03:37" (1/1) ... [2024-10-11 13:03:37,271 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-11 13:03:37,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:03:37,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:03:37,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:03:37,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:03:37,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,309 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:03:37,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:03:37,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:03:37,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:03:37,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:03:37,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (1/1) ... [2024-10-11 13:03:37,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:03:37,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:03:37,390 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:03:37,393 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:03:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:03:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:03:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:03:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:03:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:03:37,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:03:37,538 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:03:37,541 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:03:37,863 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 13:03:37,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:03:37,919 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:03:37,920 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:03:37,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:03:37 BoogieIcfgContainer [2024-10-11 13:03:37,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:03:37,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:03:37,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:03:37,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:03:37,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:03:36" (1/3) ... [2024-10-11 13:03:37,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1932a83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:03:37, skipping insertion in model container [2024-10-11 13:03:37,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:03:37" (2/3) ... [2024-10-11 13:03:37,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1932a83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:03:37, skipping insertion in model container [2024-10-11 13:03:37,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:03:37" (3/3) ... [2024-10-11 13:03:37,929 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-2.i [2024-10-11 13:03:37,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:03:37,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:03:38,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:03:38,058 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;@3c2c67e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:03:38,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:03:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:03:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:03:38,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:03:38,075 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:38,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:03:38,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:03:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1798486013, now seen corresponding path program 1 times [2024-10-11 13:03:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:03:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513992173] [2024-10-11 13:03:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:38,100 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:03:38,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:03:38,104 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:03:38,105 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:03:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:38,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:03:38,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:03:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-11 13:03:38,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:03:38,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:03:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513992173] [2024-10-11 13:03:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513992173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:03:38,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:03:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:03:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571525081] [2024-10-11 13:03:38,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:03:38,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:03:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:03:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:03:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:03:38,377 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:03:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:03:38,418 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2024-10-11 13:03:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:03:38,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2024-10-11 13:03:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:03:38,431 INFO L225 Difference]: With dead ends: 73 [2024-10-11 13:03:38,432 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 13:03:38,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:03:38,438 INFO L432 NwaCegarLoop]: 50 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, 50 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:03:38,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:03:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 13:03:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 13:03:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:03:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2024-10-11 13:03:38,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 75 [2024-10-11 13:03:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:03:38,473 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2024-10-11 13:03:38,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:03:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2024-10-11 13:03:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 13:03:38,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:03:38,476 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:38,481 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:03:38,676 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:03:38,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:03:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:03:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash -750887751, now seen corresponding path program 1 times [2024-10-11 13:03:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:03:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768021737] [2024-10-11 13:03:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:03:38,679 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:03:38,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:03:38,683 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:03:38,684 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:03:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:03:38,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:03:38,830 INFO L278 TraceCheckSpWp]: Computing forward predicates...