./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.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 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:58:19,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:58:19,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:58:19,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:58:19,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:58:19,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:58:19,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:58:19,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:58:19,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:58:19,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:58:19,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:58:19,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:58:19,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:58:19,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:58:19,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:58:19,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:58:19,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:58:19,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:58:19,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:58:19,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:58:19,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:58:19,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:58:19,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:58:19,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:58:19,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:58:19,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:58:19,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:58:19,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:58:19,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:58:19,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:58:19,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:58:19,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:58:19,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:19,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:58:19,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:58:19,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:58:19,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:58:19,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:58:19,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:58:19,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:58:19,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:58:19,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:58:19,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 -> 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 [2024-11-12 06:58:20,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:58:20,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:58:20,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:58:20,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:58:20,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:58:20,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-11-12 06:58:21,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:58:21,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:58:21,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-11-12 06:58:21,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13791ff02/88a3a36a80dd4a8591372047cae1d2b5/FLAG1e019066d [2024-11-12 06:58:21,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13791ff02/88a3a36a80dd4a8591372047cae1d2b5 [2024-11-12 06:58:21,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:58:21,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:58:21,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:21,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:58:21,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:58:21,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:21" (1/1) ... [2024-11-12 06:58:21,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7f42e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:21, skipping insertion in model container [2024-11-12 06:58:21,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:21" (1/1) ... [2024-11-12 06:58:21,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:58:22,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i[913,926] [2024-11-12 06:58:22,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:22,156 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:58:22,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i[913,926] [2024-11-12 06:58:22,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:22,242 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:58:22,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22 WrapperNode [2024-11-12 06:58:22,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:22,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:22,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:58:22,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:58:22,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,312 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-12 06:58:22,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:22,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:58:22,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:58:22,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:58:22,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,353 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:58:22,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:58:22,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:58:22,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:58:22,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:58:22,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (1/1) ... [2024-11-12 06:58:22,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:22,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:58:22,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:58:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:58:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:58:22,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:58:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:58:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:58:22,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:58:22,612 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:58:22,614 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:58:22,880 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 06:58:22,884 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:58:22,896 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:58:22,896 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:58:22,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:22 BoogieIcfgContainer [2024-11-12 06:58:22,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:58:22,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:58:22,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:58:22,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:58:22,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:58:21" (1/3) ... [2024-11-12 06:58:22,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb299e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:22, skipping insertion in model container [2024-11-12 06:58:22,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:22" (2/3) ... [2024-11-12 06:58:22,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb299e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:22, skipping insertion in model container [2024-11-12 06:58:22,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:22" (3/3) ... [2024-11-12 06:58:22,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-37.i [2024-11-12 06:58:22,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:58:22,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:58:22,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:58:22,988 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;@7bab1223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:58:22,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:58:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 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-11-12 06:58:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 06:58:23,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:23,002 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 06:58:23,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:23,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -616977591, now seen corresponding path program 1 times [2024-11-12 06:58:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119100235] [2024-11-12 06:58:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:58:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:58:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119100235] [2024-11-12 06:58:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119100235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:58:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733955284] [2024-11-12 06:58:23,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:23,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:58:23,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:58:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:23,379 INFO L87 Difference]: Start difference. First operand has 57 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-11-12 06:58:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:23,414 INFO L93 Difference]: Finished difference Result 107 states and 177 transitions. [2024-11-12 06:58:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:58:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 100 [2024-11-12 06:58:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:23,426 INFO L225 Difference]: With dead ends: 107 [2024-11-12 06:58:23,426 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 06:58:23,430 INFO L434 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-11-12 06:58:23,436 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:23,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 06:58:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-12 06:58:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-11-12 06:58:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-12 06:58:23,488 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 100 [2024-11-12 06:58:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:23,488 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-12 06:58:23,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-11-12 06:58:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-12 06:58:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 06:58:23,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:23,496 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 06:58:23,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:58:23,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:23,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1441110923, now seen corresponding path program 1 times [2024-11-12 06:58:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41256545] [2024-11-12 06:58:23,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:58:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:58:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:58:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:58:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:58:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:58:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:58:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:58:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:58:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:58:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:58:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:58:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:58:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:58:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 06:58:24,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41256545] [2024-11-12 06:58:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41256545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373159256] [2024-11-12 06:58:24,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:24,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:58:24,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:58:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:24,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 06:58:24,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 42 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 06:58:25,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 06:58:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373159256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:58:25,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 06:58:25,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-12 06:58:25,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889214178] [2024-11-12 06:58:25,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 06:58:25,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 06:58:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 06:58:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-12 06:58:25,447 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 06:58:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:25,816 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2024-11-12 06:58:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 06:58:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 100 [2024-11-12 06:58:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:25,818 INFO L225 Difference]: With dead ends: 115 [2024-11-12 06:58:25,818 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 06:58:25,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2024-11-12 06:58:25,820 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 103 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:25,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 158 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:58:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 06:58:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-11-12 06:58:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 06:58:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2024-11-12 06:58:25,829 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 100 [2024-11-12 06:58:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:25,829 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2024-11-12 06:58:25,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 06:58:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2024-11-12 06:58:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 06:58:25,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:25,831 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 06:58:25,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:58:26,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:26,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1699276361, now seen corresponding path program 1 times [2024-11-12 06:58:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681689405] [2024-11-12 06:58:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:58:26,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601676692] [2024-11-12 06:58:26,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:26,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:26,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:26,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:58:26,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 06:58:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:26,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 06:58:26,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-12 06:58:38,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 06:58:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681689405] [2024-11-12 06:58:38,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 06:58:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601676692] [2024-11-12 06:58:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601676692] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:38,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:58:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-11-12 06:58:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874294827] [2024-11-12 06:58:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:58:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:58:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=123, Unknown=2, NotChecked=0, Total=156 [2024-11-12 06:58:38,968 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-12 06:58:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:43,064 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2024-11-12 06:58:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:58:43,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 100 [2024-11-12 06:58:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:43,068 INFO L225 Difference]: With dead ends: 157 [2024-11-12 06:58:43,069 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 06:58:43,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=35, Invalid=144, Unknown=3, NotChecked=0, Total=182 [2024-11-12 06:58:43,072 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 71 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:43,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 251 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 06:58:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2024-11-12 06:58:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 06:58:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-11-12 06:58:43,084 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 100 [2024-11-12 06:58:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:43,084 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-11-12 06:58:43,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-12 06:58:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2024-11-12 06:58:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 06:58:43,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:43,086 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 06:58:43,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 06:58:43,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 06:58:43,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:43,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1915632565, now seen corresponding path program 1 times [2024-11-12 06:58:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261379649] [2024-11-12 06:58:43,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:58:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394215871] [2024-11-12 06:58:43,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:43,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:43,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:58:43,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 06:58:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:58:43,498 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:58:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:58:43,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:58:43,580 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:58:43,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:58:43,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 06:58:43,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:43,790 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 06:58:43,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:58:43,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:58:43 BoogieIcfgContainer [2024-11-12 06:58:43,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:58:43,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:58:43,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:58:43,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:58:43,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:22" (3/4) ... [2024-11-12 06:58:43,870 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:58:43,871 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:58:43,872 INFO L158 Benchmark]: Toolchain (without parser) took 21962.70ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 97.5MB in the beginning and 94.8MB in the end (delta: 2.7MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2024-11-12 06:58:43,872 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:58:43,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.62ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 146.0MB in the end (delta: -48.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-12 06:58:43,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.84ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 146.2MB in the end (delta: -286.6kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-12 06:58:43,873 INFO L158 Benchmark]: Boogie Preprocessor took 100.68ms. Allocated memory is still 176.2MB. Free memory was 146.2MB in the beginning and 147.1MB in the end (delta: -874.2kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:58:43,873 INFO L158 Benchmark]: RCFGBuilder took 478.55ms. Allocated memory is still 176.2MB. Free memory was 147.1MB in the beginning and 125.9MB in the end (delta: 21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 06:58:43,873 INFO L158 Benchmark]: TraceAbstraction took 20967.24ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 125.9MB in the beginning and 94.8MB in the end (delta: 31.1MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-12 06:58:43,874 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 222.3MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:58:43,875 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.15ms. Allocated memory is still 176.2MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.62ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 146.0MB in the end (delta: -48.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.84ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 146.2MB in the end (delta: -286.6kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.68ms. Allocated memory is still 176.2MB. Free memory was 146.2MB in the beginning and 147.1MB in the end (delta: -874.2kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 478.55ms. Allocated memory is still 176.2MB. Free memory was 147.1MB in the beginning and 125.9MB in the end (delta: 21.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20967.24ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 125.9MB in the beginning and 94.8MB in the end (delta: 31.1MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 222.3MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_3 = 100; [L25] unsigned char var_1_6 = 16; [L26] signed char var_1_7 = -25; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 25; [L29] signed char var_1_10 = -10; [L30] signed char var_1_11 = 0; [L31] float var_1_12 = 25.1; [L32] unsigned long int var_1_13 = 2531521428; [L33] signed long int var_1_14 = -128; [L34] signed long int var_1_15 = 256; [L35] signed short int var_1_16 = -16; VAL [isInitial=0, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=59049, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L72] var_1_8 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L82] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L39] var_1_14 = var_1_8 [L40] var_1_16 = var_1_14 [L41] signed long int stepLocal_0 = (((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)); VAL [isInitial=1, stepLocal_0=63, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L42] COND FALSE !(var_1_2 <= stepLocal_0) [L45] var_1_7 = var_1_10 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L47] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] COND FALSE !(((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=0, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L54] COND TRUE 2.75f > var_1_12 [L55] var_1_11 = (var_1_10 + var_1_8) VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L90-L91] return ((((((((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_2 <= ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_7 == ((signed char) ((var_1_8 - (1 + var_1_9)) + var_1_10))) : (var_1_7 == ((signed char) var_1_10)))) && ((2.75f > var_1_12) ? (var_1_11 == ((signed char) (var_1_10 + var_1_8))) : (((var_1_13 - ((((var_1_14) > (var_1_8)) ? (var_1_14) : (var_1_8)))) > var_1_1) ? (var_1_11 == ((signed char) ((((((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) < (var_1_10)) ? (((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) : (var_1_10))))) : 1))) && (var_1_14 == ((signed long int) var_1_8))) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_14)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=4294967295, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 227 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 594 ConstructedInterpolants, 1 QuantifiedInterpolants, 2293 SizeOfPredicates, 6 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2352/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:58:43,933 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.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 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:58:46,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:58:46,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:58:46,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:58:46,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:58:46,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:58:46,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:58:46,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:58:46,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:58:46,186 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:58:46,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:58:46,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:58:46,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:58:46,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:58:46,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:58:46,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:58:46,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:58:46,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:58:46,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:58:46,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:58:46,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:58:46,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:58:46,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:58:46,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:58:46,193 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:58:46,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:58:46,194 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:58:46,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:58:46,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:58:46,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:58:46,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:58:46,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:58:46,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:58:46,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:58:46,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:46,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:58:46,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:58:46,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:58:46,197 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:58:46,197 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:58:46,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:58:46,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:58:46,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:58:46,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:58:46,198 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 -> 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 [2024-11-12 06:58:46,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:58:46,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:58:46,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:58:46,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:58:46,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:58:46,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-11-12 06:58:48,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:58:48,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:58:48,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-11-12 06:58:48,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0f732f3/e92b766aa70f44eea2e9740110a46fa8/FLAGc8acef455 [2024-11-12 06:58:48,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0f732f3/e92b766aa70f44eea2e9740110a46fa8 [2024-11-12 06:58:48,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:58:48,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:58:48,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:48,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:58:48,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:58:48,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cac1c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48, skipping insertion in model container [2024-11-12 06:58:48,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:58:48,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i[913,926] [2024-11-12 06:58:48,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:48,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:58:48,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i[913,926] [2024-11-12 06:58:48,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:48,644 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:58:48,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48 WrapperNode [2024-11-12 06:58:48,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:48,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:48,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:58:48,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:58:48,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,689 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-12 06:58:48,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:48,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:58:48,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:58:48,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:58:48,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,742 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:58:48,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:58:48,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:58:48,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:58:48,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:58:48,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (1/1) ... [2024-11-12 06:58:48,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:48,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:48,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:58:48,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:58:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:58:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:58:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:58:48,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:58:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:58:48,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:58:48,961 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:58:48,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:58:49,219 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 06:58:49,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:58:49,231 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:58:49,232 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:58:49,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:49 BoogieIcfgContainer [2024-11-12 06:58:49,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:58:49,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:58:49,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:58:49,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:58:49,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:58:48" (1/3) ... [2024-11-12 06:58:49,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:49, skipping insertion in model container [2024-11-12 06:58:49,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:48" (2/3) ... [2024-11-12 06:58:49,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:49, skipping insertion in model container [2024-11-12 06:58:49,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:49" (3/3) ... [2024-11-12 06:58:49,241 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-37.i [2024-11-12 06:58:49,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:58:49,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:58:49,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:58:49,324 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;@85fe586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:58:49,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:58:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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-11-12 06:58:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 06:58:49,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:49,338 INFO L218 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, 1, 1] [2024-11-12 06:58:49,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:49,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 893252525, now seen corresponding path program 1 times [2024-11-12 06:58:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:49,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547336182] [2024-11-12 06:58:49,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:49,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:58:49,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 06:58:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:49,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:58:49,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-12 06:58:49,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:58:49,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:58:49,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547336182] [2024-11-12 06:58:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547336182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:49,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:49,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:58:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881667429] [2024-11-12 06:58:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:49,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:58:49,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:58:49,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:58:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:49,651 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 06:58:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:49,679 INFO L93 Difference]: Finished difference Result 89 states and 147 transitions. [2024-11-12 06:58:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:58:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-12 06:58:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:49,690 INFO L225 Difference]: With dead ends: 89 [2024-11-12 06:58:49,690 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 06:58:49,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:49,700 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:49,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 06:58:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-12 06:58:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11-12 06:58:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-12 06:58:49,745 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 97 [2024-11-12 06:58:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:49,746 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-12 06:58:49,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 06:58:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-12 06:58:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 06:58:49,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:49,750 INFO L218 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, 1, 1] [2024-11-12 06:58:49,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:58:49,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:49,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash -664290645, now seen corresponding path program 1 times [2024-11-12 06:58:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475647763] [2024-11-12 06:58:49,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:49,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:49,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:49,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:58:49,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:58:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:50,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 06:58:50,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-12 06:58:50,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:50,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:58:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475647763] [2024-11-12 06:58:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475647763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [836779534] [2024-11-12 06:58:50,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 06:58:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 06:58:50,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 06:58:50,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 06:58:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:51,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 06:58:51,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-12 06:58:51,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [836779534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:51,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:58:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-12 06:58:51,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471115510] [2024-11-12 06:58:51,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:58:51,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 06:58:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:58:51,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 06:58:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:58:51,437 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 06:58:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:51,799 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2024-11-12 06:58:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 06:58:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 97 [2024-11-12 06:58:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:51,802 INFO L225 Difference]: With dead ends: 97 [2024-11-12 06:58:51,802 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 06:58:51,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-12 06:58:51,804 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:51,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 132 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:58:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 06:58:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-12 06:58:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 06:58:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-12 06:58:51,814 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 97 [2024-11-12 06:58:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:51,815 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-12 06:58:51,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 06:58:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-12 06:58:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 06:58:51,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:51,818 INFO L218 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, 1, 1] [2024-11-12 06:58:51,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-12 06:58:52,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:58:52,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-12 06:58:52,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 15767725, now seen corresponding path program 1 times [2024-11-12 06:58:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702206718] [2024-11-12 06:58:52,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:52,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:52,232 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-11-12 06:58:52,233 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-11-12 06:58:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:52,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 06:58:52,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 222 proven. 102 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-12 06:58:53,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:56,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:58:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702206718] [2024-11-12 06:58:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702206718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1429711155] [2024-11-12 06:58:56,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 06:58:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 06:58:56,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 06:58:56,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 06:58:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:57,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 06:58:57,155 INFO L279 TraceCheckSpWp]: Computing forward predicates...