./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.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-96.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 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:10:34,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:10:34,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:10:34,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:10:34,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:10:34,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:10:34,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:10:34,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:10:34,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:10:34,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:10:34,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:10:34,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:10:34,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:10:34,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:10:34,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:10:34,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:10:34,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:10:34,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:10:34,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:10:34,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:10:34,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:10:34,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:10:34,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:10:34,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:10:34,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:10:34,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:10:34,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:10:34,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:10:34,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:10:34,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:10:34,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:10:34,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:10:34,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:10:34,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:10:34,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:10:34,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:10:34,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:10:34,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:10:34,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:10:34,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:10:34,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:10:34,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:10:34,687 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 -> 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad [2024-11-10 09:10:34,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:10:35,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:10:35,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:10:35,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:10:35,019 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:10:35,021 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-96.i [2024-11-10 09:10:36,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:10:36,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:10:36,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2024-11-10 09:10:36,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eff058a6/8764d3dd05b845a99d5572a1f3e7c9a8/FLAG4979ce986 [2024-11-10 09:10:37,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eff058a6/8764d3dd05b845a99d5572a1f3e7c9a8 [2024-11-10 09:10:37,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:10:37,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:10:37,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:10:37,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:10:37,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:10:37,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af42dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37, skipping insertion in model container [2024-11-10 09:10:37,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:10:37,253 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-96.i[913,926] [2024-11-10 09:10:37,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:10:37,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:10:37,322 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-96.i[913,926] [2024-11-10 09:10:37,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:10:37,368 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:10:37,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37 WrapperNode [2024-11-10 09:10:37,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:10:37,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:10:37,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:10:37,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:10:37,380 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:10:37" (1/1) ... [2024-11-10 09:10:37,389 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:10:37" (1/1) ... [2024-11-10 09:10:37,422 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-10 09:10:37,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:10:37,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:10:37,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:10:37,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:10:37,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,464 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:10:37,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:10:37,479 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:10:37,479 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:10:37,479 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:10:37,481 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (1/1) ... [2024-11-10 09:10:37,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:10:37,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:10:37,530 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:10:37,538 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:10:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:10:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:10:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:10:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:10:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:10:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:10:37,703 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:10:37,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:10:37,984 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 09:10:37,985 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:10:38,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:10:38,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:10:38,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:10:38 BoogieIcfgContainer [2024-11-10 09:10:38,004 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:10:38,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:10:38,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:10:38,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:10:38,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:10:37" (1/3) ... [2024-11-10 09:10:38,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5f2e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:10:38, skipping insertion in model container [2024-11-10 09:10:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:37" (2/3) ... [2024-11-10 09:10:38,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5f2e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:10:38, skipping insertion in model container [2024-11-10 09:10:38,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:10:38" (3/3) ... [2024-11-10 09:10:38,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-96.i [2024-11-10 09:10:38,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:10:38,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:10:38,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:10:38,099 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;@7c5bfc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:10:38,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:10:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:10:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:10:38,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:10:38,116 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:38,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:10:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:10:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash -269312515, now seen corresponding path program 1 times [2024-11-10 09:10:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:10:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298826200] [2024-11-10 09:10:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:10:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:10:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:10:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:10:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:10:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:10:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:10:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:10:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:10:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:10:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:10:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:10:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:10:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:10:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:10:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:10:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:10:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 09:10:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:10:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:10:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298826200] [2024-11-10 09:10:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298826200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:10:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:10:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:10:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118312268] [2024-11-10 09:10:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:10:38,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:10:38,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:10:38,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:10:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:10:38,542 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:10:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:10:38,570 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2024-11-10 09:10:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:10:38,574 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-11-10 09:10:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:10:38,582 INFO L225 Difference]: With dead ends: 102 [2024-11-10 09:10:38,583 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 09:10:38,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:10:38,592 INFO L432 NwaCegarLoop]: 71 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, 71 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:10:38,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:10:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 09:10:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 09:10:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:10:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-11-10 09:10:38,642 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 105 [2024-11-10 09:10:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:10:38,643 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-11-10 09:10:38,644 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:10:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-11-10 09:10:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:10:38,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:10:38,648 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:38,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:10:38,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:10:38,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:10:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1799615135, now seen corresponding path program 1 times [2024-11-10 09:10:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:10:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925820312] [2024-11-10 09:10:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:10:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:10:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:10:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:10:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:10:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:10:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:10:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:10:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:10:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:10:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:10:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:10:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:10:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:10:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:10:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:10:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:10:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 09:10:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:10:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:10:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925820312] [2024-11-10 09:10:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925820312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:10:39,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:10:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:10:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179126895] [2024-11-10 09:10:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:10:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:10:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:10:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:10:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:10:39,214 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:10:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:10:39,397 INFO L93 Difference]: Finished difference Result 156 states and 221 transitions. [2024-11-10 09:10:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:10:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-10 09:10:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:10:39,400 INFO L225 Difference]: With dead ends: 156 [2024-11-10 09:10:39,402 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 09:10:39,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:10:39,405 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 71 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:10:39,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 192 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:10:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 09:10:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2024-11-10 09:10:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:10:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-11-10 09:10:39,441 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 105 [2024-11-10 09:10:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:10:39,443 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-11-10 09:10:39,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:10:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-11-10 09:10:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:10:39,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:10:39,447 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:10:39,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:10:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:10:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1603101630, now seen corresponding path program 1 times [2024-11-10 09:10:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:10:39,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53284262] [2024-11-10 09:10:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:10:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:10:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:10:39,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:10:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:10:39,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:10:39,681 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:10:39,682 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:10:39,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:10:39,687 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 09:10:39,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:10:39,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:10:39 BoogieIcfgContainer [2024-11-10 09:10:39,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:10:39,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:10:39,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:10:39,780 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:10:39,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:10:38" (3/4) ... [2024-11-10 09:10:39,783 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:10:39,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:10:39,787 INFO L158 Benchmark]: Toolchain (without parser) took 2745.16ms. Allocated memory is still 184.5MB. Free memory was 134.9MB in the beginning and 103.2MB in the end (delta: 31.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-10 09:10:39,788 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:10:39,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.28ms. Allocated memory is still 184.5MB. Free memory was 134.9MB in the beginning and 120.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:10:39,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.74ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 117.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:10:39,788 INFO L158 Benchmark]: Boogie Preprocessor took 54.61ms. Allocated memory is still 184.5MB. Free memory was 117.3MB in the beginning and 113.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:10:39,789 INFO L158 Benchmark]: IcfgBuilder took 525.20ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 141.0MB in the end (delta: -27.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 09:10:39,791 INFO L158 Benchmark]: TraceAbstraction took 1772.75ms. Allocated memory is still 184.5MB. Free memory was 141.0MB in the beginning and 103.2MB in the end (delta: 37.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-11-10 09:10:39,791 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 184.5MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:10:39,793 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.18ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 64.9MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.28ms. Allocated memory is still 184.5MB. Free memory was 134.9MB in the beginning and 120.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.74ms. Allocated memory is still 184.5MB. Free memory was 120.1MB in the beginning and 117.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.61ms. Allocated memory is still 184.5MB. Free memory was 117.3MB in the beginning and 113.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 525.20ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 141.0MB in the end (delta: -27.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1772.75ms. Allocated memory is still 184.5MB. Free memory was 141.0MB in the beginning and 103.2MB in the end (delta: 37.8MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 184.5MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 0; [L30] double var_1_11 = 4.575; [L31] double var_1_13 = 2.75; [L32] double var_1_14 = 128.5; [L33] signed long int var_1_15 = -1000000000; [L34] float var_1_16 = 99999.25; [L35] signed char var_1_17 = 1; [L36] signed char var_1_18 = 50; [L37] unsigned char last_1_var_1_5 = 1; VAL [isInitial=0, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L71] var_1_3 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L74] var_1_4 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L87] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L89] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L90] var_1_18 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L91] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=8, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(! last_1_var_1_5) [L44] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L46] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L47] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L56] var_1_15 = var_1_1 [L57] var_1_16 = var_1_13 [L58] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=-127, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L59] COND FALSE !(((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=-127, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((((! last_1_var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && ((var_1_3 >= 16) || last_1_var_1_5)) ? (var_1_6 ? (var_1_5 == ((unsigned char) ((var_1_1 < var_1_1) && var_1_9))) : (var_1_5 == ((unsigned char) var_1_10))) : 1) : 1)) && ((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) ? (((var_1_15 / -5) >= ((var_1_4 + var_1_15) - ((((var_1_1) < (var_1_3)) ? (var_1_1) : (var_1_3))))) ? (var_1_11 == ((double) (var_1_13 + var_1_14))) : (var_1_11 == ((double) var_1_14))) : 1)) && (var_1_15 == ((signed long int) var_1_1))) && (var_1_16 == ((float) var_1_13))) && (var_1_17 == ((signed char) var_1_18)) ; VAL [\result=0, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=-127, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=-127, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=-127, var_1_18=-127, var_1_1=65530, var_1_2=0, var_1_3=65530, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 137 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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:10:39,828 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-96.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 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:10:42,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:10:42,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:10:42,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:10:42,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:10:42,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:10:42,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:10:42,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:10:42,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:10:42,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:10:42,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:10:42,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:10:42,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:10:42,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:10:42,197 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:10:42,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:10:42,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:10:42,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:10:42,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:10:42,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:10:42,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:10:42,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:10:42,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:10:42,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:10:42,202 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:10:42,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:10:42,202 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:10:42,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:10:42,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:10:42,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:10:42,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:10:42,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:10:42,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:10:42,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:10:42,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:10:42,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:10:42,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:10:42,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:10:42,207 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:10:42,207 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:10:42,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:10:42,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:10:42,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:10:42,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:10:42,209 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 -> 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad [2024-11-10 09:10:42,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:10:42,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:10:42,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:10:42,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:10:42,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:10:42,563 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-96.i [2024-11-10 09:10:44,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:10:44,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:10:44,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2024-11-10 09:10:44,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114f7d330/7646078402ce481a8a919894cb3463b1/FLAGd663f474c [2024-11-10 09:10:44,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114f7d330/7646078402ce481a8a919894cb3463b1 [2024-11-10 09:10:44,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:10:44,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:10:44,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:10:44,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:10:44,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:10:44,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6417e5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44, skipping insertion in model container [2024-11-10 09:10:44,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:10:44,605 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-96.i[913,926] [2024-11-10 09:10:44,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:10:44,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:10:44,700 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-96.i[913,926] [2024-11-10 09:10:44,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:10:44,755 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:10:44,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44 WrapperNode [2024-11-10 09:10:44,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:10:44,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:10:44,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:10:44,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:10:44,764 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:10:44" (1/1) ... [2024-11-10 09:10:44,781 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:10:44" (1/1) ... [2024-11-10 09:10:44,810 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-10 09:10:44,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:10:44,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:10:44,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:10:44,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:10:44,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,847 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:10:44,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:10:44,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:10:44,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:10:44,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:10:44,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (1/1) ... [2024-11-10 09:10:44,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:10:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:10:44,918 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:10:44,921 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:10:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:10:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:10:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:10:44,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:10:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:10:44,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:10:45,042 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:10:45,044 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:10:45,897 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 09:10:45,898 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:10:45,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:10:45,913 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:10:45,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:10:45 BoogieIcfgContainer [2024-11-10 09:10:45,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:10:45,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:10:45,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:10:45,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:10:45,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:10:44" (1/3) ... [2024-11-10 09:10:45,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcca5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:10:45, skipping insertion in model container [2024-11-10 09:10:45,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:10:44" (2/3) ... [2024-11-10 09:10:45,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcca5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:10:45, skipping insertion in model container [2024-11-10 09:10:45,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:10:45" (3/3) ... [2024-11-10 09:10:45,925 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-96.i [2024-11-10 09:10:45,939 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:10:45,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:10:46,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:10:46,012 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;@168802a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:10:46,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:10:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:10:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:10:46,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:10:46,025 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:46,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:10:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:10:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -269312515, now seen corresponding path program 1 times [2024-11-10 09:10:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:10:46,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142250003] [2024-11-10 09:10:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:10:46,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:10:46,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:10:46,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:10:46,044 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:10:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:46,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:10:46,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:10:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-10 09:10:46,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:10:46,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:10:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142250003] [2024-11-10 09:10:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142250003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:10:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:10:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:10:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104421636] [2024-11-10 09:10:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:10:46,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:10:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:10:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:10:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:10:46,377 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:10:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:10:46,412 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2024-11-10 09:10:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:10:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-11-10 09:10:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:10:46,424 INFO L225 Difference]: With dead ends: 102 [2024-11-10 09:10:46,424 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 09:10:46,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:10:46,433 INFO L432 NwaCegarLoop]: 71 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, 71 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:10:46,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:10:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 09:10:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 09:10:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:10:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-11-10 09:10:46,483 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 105 [2024-11-10 09:10:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:10:46,485 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-11-10 09:10:46,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:10:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-11-10 09:10:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:10:46,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:10:46,491 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:46,501 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:10:46,692 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:10:46,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:10:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:10:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1799615135, now seen corresponding path program 1 times [2024-11-10 09:10:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:10:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490159340] [2024-11-10 09:10:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:10:46,695 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:10:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:10:46,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:10:46,697 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:10:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:46,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:10:46,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:10:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:10:47,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:10:47,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:10:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490159340] [2024-11-10 09:10:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490159340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:10:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:10:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:10:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294821391] [2024-11-10 09:10:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:10:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:10:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:10:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:10:47,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:10:47,337 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:10:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:10:48,093 INFO L93 Difference]: Finished difference Result 156 states and 221 transitions. [2024-11-10 09:10:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:10:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-10 09:10:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:10:48,109 INFO L225 Difference]: With dead ends: 156 [2024-11-10 09:10:48,109 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 09:10:48,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:10:48,111 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 68 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:10:48,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 192 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:10:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 09:10:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2024-11-10 09:10:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:10:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-11-10 09:10:48,141 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 105 [2024-11-10 09:10:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:10:48,144 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-11-10 09:10:48,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:10:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-11-10 09:10:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 09:10:48,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:10:48,147 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:10:48,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:10:48,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:10:48,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:10:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1603101630, now seen corresponding path program 1 times [2024-11-10 09:10:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:10:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427960572] [2024-11-10 09:10:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:10:48,355 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:10:48,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:10:48,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:10:48,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:10:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:10:48,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:10:48,550 INFO L278 TraceCheckSpWp]: Computing forward predicates...