./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-67.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 ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:07:11,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:07:11,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:07:11,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:07:11,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:07:11,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:07:11,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:07:11,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:07:11,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:07:11,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:07:11,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:07:11,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:07:11,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:07:11,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:07:11,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:07:11,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:07:11,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:07:11,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:07:11,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:07:11,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:07:11,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:07:11,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:07:11,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:07:11,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:07:11,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:07:11,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:07:11,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:07:11,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:07:11,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:07:11,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:07:11,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:07:11,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:07:11,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:07:11,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:07:11,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:07:11,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:07:11,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:07:11,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:07:11,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:07:11,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:07:11,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:07:11,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:07:11,150 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 -> ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 [2024-11-10 09:07:11,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:07:11,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:07:11,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:07:11,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:07:11,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:07:11,426 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-67.i [2024-11-10 09:07:12,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:07:13,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:07:13,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2024-11-10 09:07:13,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c58e1e68/fcb915c572514506add6eb36dd37e9d3/FLAGbd60d57e4 [2024-11-10 09:07:13,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c58e1e68/fcb915c572514506add6eb36dd37e9d3 [2024-11-10 09:07:13,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:07:13,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:07:13,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:07:13,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:07:13,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:07:13,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273d8ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13, skipping insertion in model container [2024-11-10 09:07:13,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:07:13,663 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-67.i[913,926] [2024-11-10 09:07:13,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:07:13,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:07:13,724 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-67.i[913,926] [2024-11-10 09:07:13,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:07:13,763 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:07:13,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13 WrapperNode [2024-11-10 09:07:13,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:07:13,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:07:13,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:07:13,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:07:13,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,851 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-10 09:07:13,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:07:13,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:07:13,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:07:13,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:07:13,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,890 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-10 09:07:13,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:07:13,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:07:13,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:07:13,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:07:13,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (1/1) ... [2024-11-10 09:07:13,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:07:13,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:07:13,949 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-10 09:07:13,952 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-10 09:07:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:07:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:07:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:07:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:07:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:07:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:07:14,070 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:07:14,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:07:14,379 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise11#1;havoc property_#t~short12#1; [2024-11-10 09:07:14,418 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 09:07:14,419 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:07:14,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:07:14,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:07:14,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:07:14 BoogieIcfgContainer [2024-11-10 09:07:14,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:07:14,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:07:14,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:07:14,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:07:14,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:07:13" (1/3) ... [2024-11-10 09:07:14,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196eba60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:07:14, skipping insertion in model container [2024-11-10 09:07:14,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:13" (2/3) ... [2024-11-10 09:07:14,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196eba60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:07:14, skipping insertion in model container [2024-11-10 09:07:14,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:07:14" (3/3) ... [2024-11-10 09:07:14,455 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-67.i [2024-11-10 09:07:14,472 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:07:14,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:07:14,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:07:14,562 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;@5ec7e0b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:07:14,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:07:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:07:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:07:14,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:07:14,580 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:07:14,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:07:14,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:07:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1900438185, now seen corresponding path program 1 times [2024-11-10 09:07:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:07:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276740786] [2024-11-10 09:07:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:07:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:07:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:07:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:07:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:07:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:07:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:07:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:07:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:07:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:07:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:07:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:07:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:07:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:07:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:07:14,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276740786] [2024-11-10 09:07:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276740786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:07:14,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:07:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:07:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985710978] [2024-11-10 09:07:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:07:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:07:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:07:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:07:14,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:07:14,916 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:07:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:07:14,947 INFO L93 Difference]: Finished difference Result 100 states and 157 transitions. [2024-11-10 09:07:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:07:14,951 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2024-11-10 09:07:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:07:14,960 INFO L225 Difference]: With dead ends: 100 [2024-11-10 09:07:14,961 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 09:07:14,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:07:14,969 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:07:14,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:07:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 09:07:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 09:07:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:07:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2024-11-10 09:07:15,010 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 85 [2024-11-10 09:07:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:07:15,011 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-11-10 09:07:15,011 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:07:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2024-11-10 09:07:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:07:15,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:07:15,015 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:07:15,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:07:15,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:07:15,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:07:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash -915122869, now seen corresponding path program 1 times [2024-11-10 09:07:15,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:07:15,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747344751] [2024-11-10 09:07:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:07:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:07:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:07:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:07:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:07:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:07:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:07:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:07:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:07:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:07:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:07:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:07:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:07:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:07:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:07:15,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747344751] [2024-11-10 09:07:15,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747344751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:07:15,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:07:15,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:07:15,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656565215] [2024-11-10 09:07:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:07:15,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:07:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:07:15,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:07:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:07:15,694 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:07:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:07:15,864 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2024-11-10 09:07:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:07:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-11-10 09:07:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:07:15,867 INFO L225 Difference]: With dead ends: 117 [2024-11-10 09:07:15,867 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 09:07:15,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:07:15,869 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:07:15,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 219 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:07:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 09:07:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2024-11-10 09:07:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:07:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2024-11-10 09:07:15,881 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 85 [2024-11-10 09:07:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:07:15,882 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2024-11-10 09:07:15,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:07:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2024-11-10 09:07:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:07:15,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:07:15,885 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:07:15,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:07:15,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:07:15,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:07:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1208525876, now seen corresponding path program 1 times [2024-11-10 09:07:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:07:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675576092] [2024-11-10 09:07:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:07:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:07:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:07:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:07:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:07:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:07:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:07:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:07:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:07:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:07:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:07:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:07:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:07:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 09:07:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:07:16,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675576092] [2024-11-10 09:07:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675576092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:07:16,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:07:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:07:16,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451434573] [2024-11-10 09:07:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:07:16,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:07:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:07:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:07:16,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:07:16,258 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:07:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:07:16,345 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2024-11-10 09:07:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:07:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-11-10 09:07:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:07:16,351 INFO L225 Difference]: With dead ends: 127 [2024-11-10 09:07:16,351 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 09:07:16,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:07:16,353 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:07:16,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 395 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:07:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 09:07:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2024-11-10 09:07:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:07:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-11-10 09:07:16,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 85 [2024-11-10 09:07:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:07:16,368 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-11-10 09:07:16,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 09:07:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-11-10 09:07:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 09:07:16,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:07:16,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:07:16,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:07:16,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:07:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:07:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1186641357, now seen corresponding path program 1 times [2024-11-10 09:07:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:07:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421421789] [2024-11-10 09:07:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:07:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:07:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144834117] [2024-11-10 09:07:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:16,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:07:16,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:07:16,468 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-10 09:07:16,470 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-10 09:07:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:07:16,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:07:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:07:16,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:07:16,718 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:07:16,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:07:16,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:07:16,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:07:16,929 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 09:07:17,018 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:07:17,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:07:17 BoogieIcfgContainer [2024-11-10 09:07:17,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:07:17,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:07:17,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:07:17,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:07:17,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:07:14" (3/4) ... [2024-11-10 09:07:17,030 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:07:17,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:07:17,033 INFO L158 Benchmark]: Toolchain (without parser) took 3564.25ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 100.3MB in the beginning and 126.0MB in the end (delta: -25.6MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-10 09:07:17,034 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:07:17,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.25ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 86.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:07:17,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.80ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:07:17,036 INFO L158 Benchmark]: Boogie Preprocessor took 55.69ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 80.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:07:17,036 INFO L158 Benchmark]: IcfgBuilder took 531.37ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 80.8MB in the beginning and 204.0MB in the end (delta: -123.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-10 09:07:17,037 INFO L158 Benchmark]: TraceAbstraction took 2581.16ms. Allocated memory is still 239.1MB. Free memory was 202.9MB in the beginning and 127.0MB in the end (delta: 75.9MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-11-10 09:07:17,037 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 239.1MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:07:17,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.25ms. Allocated memory is still 159.4MB. Free memory was 100.3MB in the beginning and 86.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.80ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.69ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 80.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 531.37ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 80.8MB in the beginning and 204.0MB in the end (delta: -123.2MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2581.16ms. Allocated memory is still 239.1MB. Free memory was 202.9MB in the beginning and 127.0MB in the end (delta: 75.9MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 239.1MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] unsigned short int var_1_7 = 256; [L27] signed long int var_1_8 = 50; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = -4; [L30] float var_1_11 = 15.125; [L31] float var_1_12 = 0.9; [L32] double var_1_13 = 25.875; [L33] unsigned short int var_1_14 = 50; [L34] signed short int last_1_var_1_1 = 2; [L35] unsigned short int last_1_var_1_6 = 128; [L36] signed long int last_1_var_1_8 = 50; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L89] last_1_var_1_1 = var_1_1 [L90] last_1_var_1_6 = var_1_6 [L91] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L72] var_1_5 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L73] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L75] var_1_7 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=0] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50] [L80] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L81] var_1_10 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L83] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L84] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L85] var_1_12 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE ! (last_1_var_1_6 <= last_1_var_1_1) [L41] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L43] signed long int stepLocal_0 = 1 * var_1_4; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L44] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L44] COND TRUE (var_1_1 >> var_1_5) > stepLocal_0 [L45] var_1_6 = (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L49] var_1_11 = var_1_12 [L50] var_1_13 = var_1_12 [L51] var_1_14 = var_1_7 [L52] signed long int stepLocal_2 = var_1_4 / var_1_10; [L53] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L54] COND TRUE \read(var_1_9) [L55] var_1_8 = ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L94] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L94-L95] return ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7)))) && (var_1_9 ? (var_1_8 == ((signed long int) ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))))) : ((var_1_14 > (var_1_4 / var_1_10)) ? ((var_1_7 > var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_4) < (100)) ? (var_1_4) : (100))))) : (var_1_8 == ((signed long int) (last_1_var_1_8 - var_1_7)))) : (var_1_8 == ((signed long int) (var_1_6 + var_1_5)))))) && (var_1_11 == ((float) var_1_12))) && (var_1_13 == ((double) var_1_12))) && (var_1_14 == ((unsigned short int) var_1_7)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 680 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 217 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:07:17,072 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-67.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 ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:07:19,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:07:19,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:07:19,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:07:19,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:07:19,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:07:19,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:07:19,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:07:19,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:07:19,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:07:19,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:07:19,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:07:19,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:07:19,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:07:19,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:07:19,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:07:19,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:07:19,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:07:19,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:07:19,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:07:19,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:07:19,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:07:19,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:07:19,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:07:19,384 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:07:19,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:07:19,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:07:19,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:07:19,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:07:19,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:07:19,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:07:19,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:07:19,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:07:19,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:07:19,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:07:19,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:07:19,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:07:19,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:07:19,388 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:07:19,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:07:19,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:07:19,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:07:19,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:07:19,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:07:19,390 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 -> ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 [2024-11-10 09:07:19,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:07:19,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:07:19,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:07:19,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:07:19,733 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:07:19,735 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-67.i [2024-11-10 09:07:21,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:07:21,392 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:07:21,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2024-11-10 09:07:21,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453d13589/a5b6946297f64a5684680edee20d151f/FLAGb1d401d04 [2024-11-10 09:07:21,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453d13589/a5b6946297f64a5684680edee20d151f [2024-11-10 09:07:21,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:07:21,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:07:21,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:07:21,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:07:21,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:07:21,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:07:21" (1/1) ... [2024-11-10 09:07:21,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca088d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:21, skipping insertion in model container [2024-11-10 09:07:21,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:07:21" (1/1) ... [2024-11-10 09:07:21,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:07:21,971 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-67.i[913,926] [2024-11-10 09:07:22,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:07:22,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:07:22,056 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-67.i[913,926] [2024-11-10 09:07:22,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:07:22,108 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:07:22,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22 WrapperNode [2024-11-10 09:07:22,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:07:22,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:07:22,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:07:22,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:07:22,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,159 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-10 09:07:22,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:07:22,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:07:22,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:07:22,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:07:22,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,199 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-10 09:07:22,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:07:22,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:07:22,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:07:22,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:07:22,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (1/1) ... [2024-11-10 09:07:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:07:22,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:07:22,263 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-10 09:07:22,277 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-10 09:07:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:07:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:07:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:07:22,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:07:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:07:22,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:07:22,415 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:07:22,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:07:22,868 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 09:07:22,869 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:07:22,884 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:07:22,884 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:07:22,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:07:22 BoogieIcfgContainer [2024-11-10 09:07:22,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:07:22,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:07:22,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:07:22,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:07:22,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:07:21" (1/3) ... [2024-11-10 09:07:22,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d7f710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:07:22, skipping insertion in model container [2024-11-10 09:07:22,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:07:22" (2/3) ... [2024-11-10 09:07:22,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d7f710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:07:22, skipping insertion in model container [2024-11-10 09:07:22,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:07:22" (3/3) ... [2024-11-10 09:07:22,896 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-67.i [2024-11-10 09:07:22,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:07:22,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:07:22,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:07:23,001 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;@142112b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:07:23,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:07:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:07:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:07:23,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:07:23,019 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:07:23,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:07:23,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:07:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash -82239674, now seen corresponding path program 1 times [2024-11-10 09:07:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:07:23,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736527898] [2024-11-10 09:07:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:23,040 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-10 09:07:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:07:23,043 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-10 09:07:23,045 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-10 09:07:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:23,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:07:23,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:07:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-10 09:07:23,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:07:23,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:07:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736527898] [2024-11-10 09:07:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736527898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:07:23,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:07:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:07:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272327135] [2024-11-10 09:07:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:07:23,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:07:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:07:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:07:23,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:07:23,385 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:07:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:07:23,414 INFO L93 Difference]: Finished difference Result 86 states and 137 transitions. [2024-11-10 09:07:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:07:23,416 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-10 09:07:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:07:23,423 INFO L225 Difference]: With dead ends: 86 [2024-11-10 09:07:23,423 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 09:07:23,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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-10 09:07:23,432 INFO L432 NwaCegarLoop]: 58 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, 58 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-10 09:07:23,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:07:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 09:07:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 09:07:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 09:07:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-10 09:07:23,480 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-10 09:07:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:07:23,480 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-10 09:07:23,480 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-10 09:07:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-10 09:07:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:07:23,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:07:23,486 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:07:23,497 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:07:23,690 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-10 09:07:23,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:07:23,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:07:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2045181924, now seen corresponding path program 1 times [2024-11-10 09:07:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:07:23,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996283432] [2024-11-10 09:07:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:07:23,694 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-10 09:07:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:07:23,696 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-10 09:07:23,698 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-10 09:07:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:07:23,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 09:07:23,905 INFO L278 TraceCheckSpWp]: Computing forward predicates...