./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:17:21,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:17:21,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:17:21,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:17:21,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:17:21,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:17:21,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:17:21,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:17:21,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:17:21,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:17:21,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:17:21,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:17:21,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:17:21,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:17:21,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:17:21,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:17:21,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:17:21,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:17:21,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:17:21,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:17:21,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:17:21,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:17:21,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:17:21,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:17:21,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:17:21,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:17:21,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:17:21,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:17:21,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:17:21,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:17:21,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:17:21,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:17:21,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:21,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:17:21,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:17:21,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:17:21,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:17:21,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:17:21,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:17:21,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:17:21,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:17:21,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:17:21,726 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 [2024-11-09 01:17:22,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:17:22,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:17:22,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:17:22,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:17:22,056 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:17:22,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-11-09 01:17:23,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:17:23,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:17:23,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-11-09 01:17:23,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97866390a/f5d94e5c989a4934b31a04d8e6dc0156/FLAG111753ecb [2024-11-09 01:17:24,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97866390a/f5d94e5c989a4934b31a04d8e6dc0156 [2024-11-09 01:17:24,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:17:24,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:17:24,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:24,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:17:24,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:17:24,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b4f6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24, skipping insertion in model container [2024-11-09 01:17:24,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:17:24,417 WARN L250 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-11-09 01:17:24,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:24,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:17:24,485 WARN L250 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-11-09 01:17:24,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:24,528 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:17:24,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24 WrapperNode [2024-11-09 01:17:24,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:24,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:24,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:17:24,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:17:24,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,584 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-09 01:17:24,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:24,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:17:24,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:17:24,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:17:24,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,622 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-11-09 01:17:24,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:17:24,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:17:24,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:17:24,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:17:24,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (1/1) ... [2024-11-09 01:17:24,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:17:24,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:17:24,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:17:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:17:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:17:24,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:17:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:17:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:17:24,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:17:24,845 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:17:24,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:17:25,200 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 01:17:25,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:17:25,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:17:25,217 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:17:25,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:25 BoogieIcfgContainer [2024-11-09 01:17:25,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:17:25,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:17:25,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:17:25,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:17:25,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:17:24" (1/3) ... [2024-11-09 01:17:25,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e750f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:25, skipping insertion in model container [2024-11-09 01:17:25,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:24" (2/3) ... [2024-11-09 01:17:25,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e750f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:25, skipping insertion in model container [2024-11-09 01:17:25,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:25" (3/3) ... [2024-11-09 01:17:25,229 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-2.i [2024-11-09 01:17:25,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:17:25,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:17:25,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:17:25,309 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;@7d68f2cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:17:25,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:17:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 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-11-09 01:17:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 01:17:25,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:25,322 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, 1, 1] [2024-11-09 01:17:25,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:25,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1703130952, now seen corresponding path program 1 times [2024-11-09 01:17:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954679030] [2024-11-09 01:17:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:17:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:17:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:17:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:17:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:17:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:17:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:17:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:17:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954679030] [2024-11-09 01:17:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954679030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:25,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:17:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090128965] [2024-11-09 01:17:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:25,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:17:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:17:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:17:25,682 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-09 01:17:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:25,704 INFO L93 Difference]: Finished difference Result 97 states and 158 transitions. [2024-11-09 01:17:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:17:25,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 81 [2024-11-09 01:17:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:25,714 INFO L225 Difference]: With dead ends: 97 [2024-11-09 01:17:25,714 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 01:17:25,717 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-11-09 01:17:25,720 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:25,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:17:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 01:17:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 01:17:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 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-11-09 01:17:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-09 01:17:25,759 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 81 [2024-11-09 01:17:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-09 01:17:25,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-09 01:17:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-09 01:17:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 01:17:25,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:25,763 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, 1, 1] [2024-11-09 01:17:25,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:17:25,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:25,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2104728188, now seen corresponding path program 1 times [2024-11-09 01:17:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429763024] [2024-11-09 01:17:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:17:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:17:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:17:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:17:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:17:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:17:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:17:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:17:26,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429763024] [2024-11-09 01:17:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429763024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:26,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:26,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:17:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403890578] [2024-11-09 01:17:26,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:17:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:17:26,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:17:26,877 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-09 01:17:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:27,590 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2024-11-09 01:17:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:17:27,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 81 [2024-11-09 01:17:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:27,592 INFO L225 Difference]: With dead ends: 110 [2024-11-09 01:17:27,593 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 01:17:27,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:17:27,595 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:27,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 139 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:17:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 01:17:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2024-11-09 01:17:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-11-09 01:17:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-09 01:17:27,610 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 81 [2024-11-09 01:17:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:27,613 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-09 01:17:27,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-09 01:17:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-09 01:17:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 01:17:27,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:27,618 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, 1, 1] [2024-11-09 01:17:27,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:17:27,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1510180738, now seen corresponding path program 1 times [2024-11-09 01:17:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:27,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315928844] [2024-11-09 01:17:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:17:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:17:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:17:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:17:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:17:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:17:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:17:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:17:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:17:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:17:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:17:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:17:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315928844] [2024-11-09 01:17:27,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315928844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:27,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:27,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:17:27,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343719767] [2024-11-09 01:17:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:27,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:17:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:17:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:17:27,953 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-09 01:17:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:28,419 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2024-11-09 01:17:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:17:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 81 [2024-11-09 01:17:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:28,422 INFO L225 Difference]: With dead ends: 118 [2024-11-09 01:17:28,422 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 01:17:28,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:17:28,425 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:28,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 308 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:17:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 01:17:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2024-11-09 01:17:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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-11-09 01:17:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-09 01:17:28,439 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 81 [2024-11-09 01:17:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:28,440 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-09 01:17:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-09 01:17:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-09 01:17:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 01:17:28,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:28,444 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, 1, 1, 1, 1] [2024-11-09 01:17:28,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:17:28,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:28,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1629032461, now seen corresponding path program 1 times [2024-11-09 01:17:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35295629] [2024-11-09 01:17:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:17:28,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210342029] [2024-11-09 01:17:28,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:28,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:17:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:17:28,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:17:28,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:17:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:17:28,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:17:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:17:28,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:17:28,693 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:17:28,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:17:28,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:17:28,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:17:28,904 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 01:17:28,965 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:17:28,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:17:28 BoogieIcfgContainer [2024-11-09 01:17:28,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:17:28,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:17:28,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:17:28,969 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:17:28,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:25" (3/4) ... [2024-11-09 01:17:28,972 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:17:28,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:17:28,974 INFO L158 Benchmark]: Toolchain (without parser) took 4785.79ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 103.1MB in the beginning and 111.6MB in the end (delta: -8.5MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-09 01:17:28,974 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 186.6MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:28,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.79ms. Allocated memory is still 186.6MB. Free memory was 103.1MB in the beginning and 150.7MB in the end (delta: -47.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-09 01:17:28,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.10ms. Allocated memory is still 186.6MB. Free memory was 149.7MB in the beginning and 146.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:17:28,975 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 142.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:17:28,975 INFO L158 Benchmark]: RCFGBuilder took 573.44ms. Allocated memory is still 186.6MB. Free memory was 142.4MB in the beginning and 141.7MB in the end (delta: 660.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 01:17:28,976 INFO L158 Benchmark]: TraceAbstraction took 3748.37ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 140.7MB in the beginning and 111.6MB in the end (delta: 29.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2024-11-09 01:17:28,976 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 224.4MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:28,978 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.20ms. Allocated memory is still 186.6MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.79ms. Allocated memory is still 186.6MB. Free memory was 103.1MB in the beginning and 150.7MB in the end (delta: -47.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.10ms. Allocated memory is still 186.6MB. Free memory was 149.7MB in the beginning and 146.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 142.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 573.44ms. Allocated memory is still 186.6MB. Free memory was 142.4MB in the beginning and 141.7MB in the end (delta: 660.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3748.37ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 140.7MB in the beginning and 111.6MB in the end (delta: 29.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 224.4MB. Free memory is still 111.6MB. 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; VAL [isInitial=0, 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=200, var_1_6=56955, var_1_7=32, var_1_8=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 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=200, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, 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=-32769, var_1_8=32768, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 513 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 208 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 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-11-09 01:17:29,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:17:31,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:17:31,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:17:31,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:17:31,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:17:31,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:17:31,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:17:31,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:17:31,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:17:31,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:17:31,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:17:31,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:17:31,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:17:31,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:17:31,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:17:31,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:17:31,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:17:31,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:17:31,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:17:31,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:17:31,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:17:31,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:17:31,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:17:31,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:17:31,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:17:31,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:17:31,413 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:17:31,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:17:31,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:17:31,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:17:31,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:17:31,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:17:31,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:17:31,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:17:31,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:31,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:17:31,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:17:31,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:17:31,418 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:17:31,418 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:17:31,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:17:31,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:17:31,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:17:31,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:17:31,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 884d5b26a9a5c3e1f2ddd732744de1f7633395324aa060e9edd0f0bad2da1ac4 [2024-11-09 01:17:31,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:17:31,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:17:31,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:17:31,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:17:31,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:17:31,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-11-09 01:17:33,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:17:33,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:17:33,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-2.i [2024-11-09 01:17:33,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6f0c168/7d82f7935d964b1b84258708e2a142f7/FLAG772c61530 [2024-11-09 01:17:33,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f6f0c168/7d82f7935d964b1b84258708e2a142f7 [2024-11-09 01:17:33,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:17:33,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:17:33,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:33,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:17:33,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:17:33,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:33" (1/1) ... [2024-11-09 01:17:33,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abd4002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:33, skipping insertion in model container [2024-11-09 01:17:33,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:33" (1/1) ... [2024-11-09 01:17:33,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:17:33,911 WARN L250 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-11-09 01:17:33,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:33,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:17:34,020 WARN L250 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-11-09 01:17:34,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:34,071 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:17:34,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34 WrapperNode [2024-11-09 01:17:34,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:34,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:34,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:17:34,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:17:34,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,125 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-09 01:17:34,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:34,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:17:34,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:17:34,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:17:34,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,157 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-11-09 01:17:34,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:17:34,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:17:34,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:17:34,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:17:34,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (1/1) ... [2024-11-09 01:17:34,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:34,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:17:34,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:17:34,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:17:34,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:17:34,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:17:34,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:17:34,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:17:34,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:17:34,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:17:34,321 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:17:34,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:17:34,639 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:17:34,639 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:17:34,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:17:34,656 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:17:34,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:34 BoogieIcfgContainer [2024-11-09 01:17:34,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:17:34,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:17:34,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:17:34,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:17:34,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:17:33" (1/3) ... [2024-11-09 01:17:34,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e5df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:34, skipping insertion in model container [2024-11-09 01:17:34,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:34" (2/3) ... [2024-11-09 01:17:34,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e5df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:34, skipping insertion in model container [2024-11-09 01:17:34,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:34" (3/3) ... [2024-11-09 01:17:34,667 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-2.i [2024-11-09 01:17:34,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:17:34,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:17:34,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:17:34,778 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;@62829b2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:17:34,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:17:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-11-09 01:17:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 01:17:34,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:34,794 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-11-09 01:17:34,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:34,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash -475101046, now seen corresponding path program 1 times [2024-11-09 01:17:34,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:17:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183702775] [2024-11-09 01:17:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:34,816 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-11-09 01:17:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:17:34,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:17:34,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:17:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:34,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:17:34,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:17:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-09 01:17:35,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:17:35,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:17:35,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183702775] [2024-11-09 01:17:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183702775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:35,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:17:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152226421] [2024-11-09 01:17:35,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:35,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:17:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:17:35,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:17:35,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:17:35,056 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11-09 01:17:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:35,084 INFO L93 Difference]: Finished difference Result 81 states and 134 transitions. [2024-11-09 01:17:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:17:35,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (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 79 [2024-11-09 01:17:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:35,094 INFO L225 Difference]: With dead ends: 81 [2024-11-09 01:17:35,095 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 01:17:35,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-11-09 01:17:35,104 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:35,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:17:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 01:17:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 01:17:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-11-09 01:17:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2024-11-09 01:17:35,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 79 [2024-11-09 01:17:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:35,156 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2024-11-09 01:17:35,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (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-11-09 01:17:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2024-11-09 01:17:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 01:17:35,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:35,162 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-11-09 01:17:35,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:17:35,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:17:35,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:35,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2098690894, now seen corresponding path program 1 times [2024-11-09 01:17:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:17:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231029116] [2024-11-09 01:17:35,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:35,366 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-11-09 01:17:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:17:35,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:17:35,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:17:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:35,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:17:35,528 INFO L278 TraceCheckSpWp]: Computing forward predicates...