./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.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 f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:09:03,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:09:03,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:09:03,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:09:03,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:09:03,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:09:03,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:09:03,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:09:03,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:09:03,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:09:03,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:09:03,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:09:03,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:09:03,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:09:03,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:09:03,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:09:03,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:09:03,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:09:03,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:09:03,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:09:03,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:09:03,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:09:03,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:09:03,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:09:03,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:09:03,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:09:03,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:09:03,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:09:03,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:09:03,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:09:03,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:09:03,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:09:03,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:03,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:09:03,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:09:03,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:09:03,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:09:03,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:09:03,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:09:03,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:09:03,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:09:03,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:09:03,865 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 -> f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc [2024-10-24 11:09:04,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:09:04,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:09:04,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:09:04,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:09:04,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:09:04,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2024-10-24 11:09:05,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:09:05,758 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:09:05,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2024-10-24 11:09:05,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748cec5c6/6ef5525386124fa887d83db55df37bab/FLAGe5e3081d5 [2024-10-24 11:09:05,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748cec5c6/6ef5525386124fa887d83db55df37bab [2024-10-24 11:09:05,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:09:05,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:09:05,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:05,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:09:05,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:09:05,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:05" (1/1) ... [2024-10-24 11:09:05,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399d9523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:05, skipping insertion in model container [2024-10-24 11:09:05,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:05" (1/1) ... [2024-10-24 11:09:05,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:09:05,979 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i[913,926] [2024-10-24 11:09:06,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:06,034 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:09:06,044 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i[913,926] [2024-10-24 11:09:06,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:06,079 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:09:06,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06 WrapperNode [2024-10-24 11:09:06,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:06,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:06,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:09:06,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:09:06,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,158 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-24 11:09:06,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:06,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:09:06,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:09:06,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:09:06,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,209 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:09:06,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:09:06,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:09:06,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:09:06,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:09:06,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (1/1) ... [2024-10-24 11:09:06,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:09:06,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:09:06,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:09:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:09:06,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:09:06,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:09:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:09:06,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:09:06,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:09:06,426 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:09:06,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:09:06,719 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:09:06,720 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:09:06,771 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:09:06,771 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:09:06,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:06 BoogieIcfgContainer [2024-10-24 11:09:06,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:09:06,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:09:06,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:09:06,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:09:06,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:09:05" (1/3) ... [2024-10-24 11:09:06,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495d161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:06, skipping insertion in model container [2024-10-24 11:09:06,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:06" (2/3) ... [2024-10-24 11:09:06,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495d161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:06, skipping insertion in model container [2024-10-24 11:09:06,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:06" (3/3) ... [2024-10-24 11:09:06,781 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-73.i [2024-10-24 11:09:06,797 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:09:06,798 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:09:06,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:09:06,862 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;@30f8ea00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:09:06,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:09:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 11:09:06,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:06,878 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:06,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:06,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2061904121, now seen corresponding path program 1 times [2024-10-24 11:09:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057075756] [2024-10-24 11:09:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:09:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:09:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:09:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:09:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:09:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:09:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 11:09:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 11:09:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:09:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:09:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057075756] [2024-10-24 11:09:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057075756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:07,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:07,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:09:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739179318] [2024-10-24 11:09:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:07,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:09:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:09:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:07,216 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:09:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:07,255 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-24 11:09:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:09:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-24 11:09:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:07,269 INFO L225 Difference]: With dead ends: 89 [2024-10-24 11:09:07,270 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 11:09:07,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:07,277 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:07,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 11:09:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 11:09:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-24 11:09:07,322 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2024-10-24 11:09:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:07,323 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-24 11:09:07,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:09:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-24 11:09:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 11:09:07,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:07,329 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:09:07,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 709628301, now seen corresponding path program 1 times [2024-10-24 11:09:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:07,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389006791] [2024-10-24 11:09:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:09:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:09:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:09:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:09:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:09:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:09:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 11:09:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 11:09:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:09:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:09:07,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389006791] [2024-10-24 11:09:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389006791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610702556] [2024-10-24 11:09:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:07,850 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:07,889 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2024-10-24 11:09:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:07,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-24 11:09:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:07,892 INFO L225 Difference]: With dead ends: 87 [2024-10-24 11:09:07,892 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 11:09:07,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:07,894 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:07,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 11:09:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 11:09:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-24 11:09:07,905 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2024-10-24 11:09:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:07,907 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-24 11:09:07,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-24 11:09:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:09:07,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:07,909 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:07,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:09:07,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:07,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash 514105839, now seen corresponding path program 1 times [2024-10-24 11:09:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676739053] [2024-10-24 11:09:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:09:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:09:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:09:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:09:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:09:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:09:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:09:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:09:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:09:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:09:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:09:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:09:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 11:09:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 11:09:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:09:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:09:08,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:09:08,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676739053] [2024-10-24 11:09:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676739053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:08,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573184256] [2024-10-24 11:09:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:08,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:09:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:08,033 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:08,077 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2024-10-24 11:09:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-24 11:09:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:08,082 INFO L225 Difference]: With dead ends: 99 [2024-10-24 11:09:08,082 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 11:09:08,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:08,084 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:08,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:09:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 11:09:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-24 11:09:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-10-24 11:09:08,092 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2024-10-24 11:09:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-10-24 11:09:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-10-24 11:09:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:09:08,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:08,095 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:09:08,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 514165421, now seen corresponding path program 1 times [2024-10-24 11:09:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:09:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518009271] [2024-10-24 11:09:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:09:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:09:08,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:09:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:09:08,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:09:08,263 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:09:08,265 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:09:08,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:09:08,270 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:09:08,355 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:09:08,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:09:08 BoogieIcfgContainer [2024-10-24 11:09:08,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:09:08,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:09:08,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:09:08,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:09:08,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:06" (3/4) ... [2024-10-24 11:09:08,364 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:09:08,368 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:09:08,369 INFO L158 Benchmark]: Toolchain (without parser) took 2584.47ms. Allocated memory is still 169.9MB. Free memory was 100.6MB in the beginning and 60.9MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 11:09:08,369 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:09:08,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.34ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 86.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:09:08,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.43ms. Allocated memory is still 169.9MB. Free memory was 86.0MB in the beginning and 139.2MB in the end (delta: -53.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-24 11:09:08,370 INFO L158 Benchmark]: Boogie Preprocessor took 61.95ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 135.1MB in the end (delta: 4.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:09:08,370 INFO L158 Benchmark]: RCFGBuilder took 538.44ms. Allocated memory is still 169.9MB. Free memory was 135.1MB in the beginning and 114.1MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 11:09:08,371 INFO L158 Benchmark]: TraceAbstraction took 1586.35ms. Allocated memory is still 169.9MB. Free memory was 113.4MB in the beginning and 60.9MB in the end (delta: 52.5MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-10-24 11:09:08,371 INFO L158 Benchmark]: Witness Printer took 6.78ms. Allocated memory is still 169.9MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:09:08,376 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.17ms. Allocated memory is still 169.9MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.34ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 86.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.43ms. Allocated memory is still 169.9MB. Free memory was 86.0MB in the beginning and 139.2MB in the end (delta: -53.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.95ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 135.1MB in the end (delta: 4.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.44ms. Allocated memory is still 169.9MB. Free memory was 135.1MB in the beginning and 114.1MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1586.35ms. Allocated memory is still 169.9MB. Free memory was 113.4MB in the beginning and 60.9MB in the end (delta: 52.5MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 6.78ms. Allocated memory is still 169.9MB. Free memory is still 60.9MB. 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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] float var_1_12 = 15.75; [L29] float var_1_13 = 1.6; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] float var_1_16 = 16.5; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] float last_1_var_1_12 = 15.75; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_12 = var_1_12 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L83] var_1_13 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_13 >= 0.0F && 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_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L84] RET assume_abort_if_not((var_1_13 >= 0.0F && 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_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L86] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L87] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L87] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L94] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L95] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L109] RET updateVariables() [L110] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L48] COND FALSE !(var_1_19 > var_1_9) [L59] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=10, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=106, var_1_6=1, var_1_7=106, var_1_8=5, var_1_9=5] [L69] var_1_17 = var_1_18 [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((float) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((float) (var_1_13 - var_1_16))) : (var_1_12 == ((float) var_1_16)))) : (var_1_12 == ((float) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=5, var_1_1=106, var_1_6=1, var_1_7=106, var_1_8=5, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=5, var_1_1=106, var_1_6=1, var_1_7=106, var_1_8=5, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 181 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1260/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:09:08,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.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 f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:09:10,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:09:10,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:09:10,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:09:10,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:09:10,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:09:10,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:09:10,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:09:10,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:09:10,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:09:10,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:09:10,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:09:10,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:09:10,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:09:10,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:09:10,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:09:10,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:09:10,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:09:10,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:09:10,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:09:10,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:09:10,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:09:10,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:09:10,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:09:10,738 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:09:10,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:09:10,738 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:09:10,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:09:10,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:09:10,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:09:10,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:09:10,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:09:10,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:09:10,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:09:10,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:10,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:09:10,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:09:10,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:09:10,742 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:09:10,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:09:10,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:09:10,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:09:10,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:09:10,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:09:10,745 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:09:10,745 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 -> f92f77375779269f33d6d08378e9440b45a9cd84382d3de78a8a10074b76e7bc [2024-10-24 11:09:11,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:09:11,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:09:11,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:09:11,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:09:11,108 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:09:11,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2024-10-24 11:09:12,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:09:12,819 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:09:12,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i [2024-10-24 11:09:12,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8999dc9/caa50348f1ad40e68e5f4dfd6ca8ed9e/FLAGe73877df4 [2024-10-24 11:09:12,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8999dc9/caa50348f1ad40e68e5f4dfd6ca8ed9e [2024-10-24 11:09:12,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:09:12,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:09:12,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:12,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:09:12,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:09:12,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:12" (1/1) ... [2024-10-24 11:09:12,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b39ba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:12, skipping insertion in model container [2024-10-24 11:09:12,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:09:12" (1/1) ... [2024-10-24 11:09:12,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:09:13,048 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i[913,926] [2024-10-24 11:09:13,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:13,109 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:09:13,125 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-73.i[913,926] [2024-10-24 11:09:13,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:09:13,182 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:09:13,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13 WrapperNode [2024-10-24 11:09:13,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:09:13,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:13,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:09:13,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:09:13,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,253 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-10-24 11:09:13,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:09:13,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:09:13,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:09:13,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:09:13,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,294 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:09:13,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:09:13,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:09:13,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:09:13,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:09:13,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (1/1) ... [2024-10-24 11:09:13,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:09:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:09:13,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:09:13,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:09:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:09:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:09:13,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:09:13,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:09:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:09:13,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:09:13,515 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:09:13,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:09:14,953 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:09:14,953 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:09:15,021 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:09:15,023 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:09:15,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:15 BoogieIcfgContainer [2024-10-24 11:09:15,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:09:15,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:09:15,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:09:15,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:09:15,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:09:12" (1/3) ... [2024-10-24 11:09:15,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ce3685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:15, skipping insertion in model container [2024-10-24 11:09:15,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:09:13" (2/3) ... [2024-10-24 11:09:15,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ce3685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:09:15, skipping insertion in model container [2024-10-24 11:09:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:09:15" (3/3) ... [2024-10-24 11:09:15,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-73.i [2024-10-24 11:09:15,052 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:09:15,053 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:09:15,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:09:15,137 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;@5a7e4a2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:09:15,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:09:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 11:09:15,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:15,157 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:15,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:15,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2061904121, now seen corresponding path program 1 times [2024-10-24 11:09:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821631208] [2024-10-24 11:09:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:15,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:15,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:09:15,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:09:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:15,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:09:15,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-24 11:09:15,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:09:15,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:09:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821631208] [2024-10-24 11:09:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821631208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:09:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51272378] [2024-10-24 11:09:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:15,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:09:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:09:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:09:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:15,494 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:09:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:16,455 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-24 11:09:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:09:16,472 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-24 11:09:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:16,480 INFO L225 Difference]: With dead ends: 89 [2024-10-24 11:09:16,480 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 11:09:16,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:09:16,486 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:16,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:09:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 11:09:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 11:09:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-24 11:09:16,527 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2024-10-24 11:09:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:16,527 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-24 11:09:16,527 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:09:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-24 11:09:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 11:09:16,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:16,533 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:16,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:09:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:16,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:16,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 709628301, now seen corresponding path program 1 times [2024-10-24 11:09:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:16,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35564825] [2024-10-24 11:09:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:16,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:09:16,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:09:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:16,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:09:17,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:09:17,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:09:17,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:09:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35564825] [2024-10-24 11:09:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35564825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:09:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594895004] [2024-10-24 11:09:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:17,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:09:17,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:09:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:09:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:09:17,165 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:18,742 INFO L93 Difference]: Finished difference Result 119 states and 177 transitions. [2024-10-24 11:09:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:09:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-24 11:09:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:18,745 INFO L225 Difference]: With dead ends: 119 [2024-10-24 11:09:18,745 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 11:09:18,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:09:18,749 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:18,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 213 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:09:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 11:09:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2024-10-24 11:09:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-24 11:09:18,763 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2024-10-24 11:09:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:18,765 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-24 11:09:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-24 11:09:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:09:18,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:18,768 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:18,777 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 (3)] Ended with exit code 0 [2024-10-24 11:09:18,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:18,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 514105839, now seen corresponding path program 1 times [2024-10-24 11:09:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354575921] [2024-10-24 11:09:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:18,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:18,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:18,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:09:18,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:09:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:19,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:09:19,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:09:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:09:19,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:09:19,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:09:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354575921] [2024-10-24 11:09:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354575921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:09:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:09:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:09:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156477832] [2024-10-24 11:09:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:09:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:09:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:09:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:09:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:19,232 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:09:21,011 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2024-10-24 11:09:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:09:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-24 11:09:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:09:21,028 INFO L225 Difference]: With dead ends: 99 [2024-10-24 11:09:21,028 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 11:09:21,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:09:21,030 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:09:21,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 11:09:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 11:09:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-24 11:09:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:09:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-10-24 11:09:21,042 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2024-10-24 11:09:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:09:21,044 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-10-24 11:09:21,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:09:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-10-24 11:09:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:09:21,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:09:21,048 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:09:21,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:09:21,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:21,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:09:21,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:09:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash 514165421, now seen corresponding path program 1 times [2024-10-24 11:09:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:09:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729743140] [2024-10-24 11:09:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:09:21,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:09:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:09:21,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:09:21,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:09:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:09:21,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:09:21,464 INFO L278 TraceCheckSpWp]: Computing forward predicates...