./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_codestructure_dependencies_file-9.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 c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:43:35,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:43:35,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:43:35,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:43:35,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:43:35,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:43:35,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:43:35,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:43:35,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:43:35,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:43:35,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:43:35,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:43:35,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:43:35,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:43:35,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:43:35,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:43:35,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2025-03-03 18:43:35,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:43:35,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:43:35,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:43:35,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:43:35,814 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:43:35,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-03-03 18:43:36,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe26dffc/87664cf3f73a49cc8aeb374e8d4d2c6e/FLAG7357fc7b2 [2025-03-03 18:43:37,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:43:37,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-03-03 18:43:37,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe26dffc/87664cf3f73a49cc8aeb374e8d4d2c6e/FLAG7357fc7b2 [2025-03-03 18:43:37,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe26dffc/87664cf3f73a49cc8aeb374e8d4d2c6e [2025-03-03 18:43:37,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:43:37,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:43:37,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:43:37,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:43:37,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:43:37,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f59afa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37, skipping insertion in model container [2025-03-03 18:43:37,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:43:37,590 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_codestructure_dependencies_file-9.i[918,931] [2025-03-03 18:43:37,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:43:37,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:43:37,635 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_codestructure_dependencies_file-9.i[918,931] [2025-03-03 18:43:37,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:43:37,664 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:43:37,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37 WrapperNode [2025-03-03 18:43:37,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:43:37,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:43:37,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:43:37,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:43:37,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,690 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-03-03 18:43:37,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:43:37,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:43:37,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:43:37,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:43:37,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,707 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]. [2025-03-03 18:43:37,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:43:37,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:43:37,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:43:37,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:43:37,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (1/1) ... [2025-03-03 18:43:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:43:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:37,750 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) [2025-03-03 18:43:37,752 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 [2025-03-03 18:43:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:43:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:43:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:43:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:43:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:43:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:43:37,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:43:37,832 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:43:38,135 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 18:43:38,160 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 18:43:38,160 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:43:38,171 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:43:38,171 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:43:38,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:43:38 BoogieIcfgContainer [2025-03-03 18:43:38,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:43:38,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:43:38,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:43:38,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:43:38,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:43:37" (1/3) ... [2025-03-03 18:43:38,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274887bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:43:38, skipping insertion in model container [2025-03-03 18:43:38,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:43:37" (2/3) ... [2025-03-03 18:43:38,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274887bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:43:38, skipping insertion in model container [2025-03-03 18:43:38,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:43:38" (3/3) ... [2025-03-03 18:43:38,179 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2025-03-03 18:43:38,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:43:38,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-9.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:43:38,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:43:38,236 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;@7aec52bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:43:38,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:43:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:43:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 18:43:38,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:38,246 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:38,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:38,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2020987939, now seen corresponding path program 1 times [2025-03-03 18:43:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:38,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323203329] [2025-03-03 18:43:38,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:38,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 18:43:38,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 18:43:38,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:38,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323203329] [2025-03-03 18:43:38,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323203329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:38,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:38,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:43:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63226203] [2025-03-03 18:43:38,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:38,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:43:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:38,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:43:38,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:43:38,669 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:38,700 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2025-03-03 18:43:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:43:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2025-03-03 18:43:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:38,708 INFO L225 Difference]: With dead ends: 135 [2025-03-03 18:43:38,708 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 18:43:38,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:43:38,713 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:38,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:43:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 18:43:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 18:43:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:43:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2025-03-03 18:43:38,745 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 105 [2025-03-03 18:43:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:38,746 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2025-03-03 18:43:38,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2025-03-03 18:43:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 18:43:38,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:38,748 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:38,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:43:38,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1977614401, now seen corresponding path program 1 times [2025-03-03 18:43:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666277683] [2025-03-03 18:43:38,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:38,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:38,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:38,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666277683] [2025-03-03 18:43:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666277683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:43:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729667014] [2025-03-03 18:43:41,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:41,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:41,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:41,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:43:41,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:41,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:41,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:41,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:41,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 18:43:41,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-03 18:43:41,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:43:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729667014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:43:41,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:43:41,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2025-03-03 18:43:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654113399] [2025-03-03 18:43:41,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:43:41,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:43:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:41,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:43:41,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:43:41,938 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 5 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-03-03 18:43:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:44,311 INFO L93 Difference]: Finished difference Result 216 states and 312 transitions. [2025-03-03 18:43:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:43:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 5 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) Word has length 106 [2025-03-03 18:43:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:44,313 INFO L225 Difference]: With dead ends: 216 [2025-03-03 18:43:44,313 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 18:43:44,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-03-03 18:43:44,315 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 394 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:44,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 366 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 18:43:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 18:43:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 99. [2025-03-03 18:43:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:43:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-03 18:43:44,324 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 106 [2025-03-03 18:43:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:44,324 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-03 18:43:44,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 5 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (45), 5 states have call predecessors, (45), 5 states have call successors, (45) [2025-03-03 18:43:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-03 18:43:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 18:43:44,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:44,326 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:44,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:43:44,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:44,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1257446205, now seen corresponding path program 1 times [2025-03-03 18:43:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:44,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748033694] [2025-03-03 18:43:44,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:44,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:44,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:44,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:44,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:46,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748033694] [2025-03-03 18:43:46,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748033694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:43:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473028325] [2025-03-03 18:43:46,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:46,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:46,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:43:46,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:46,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:46,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 18:43:46,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 18:43:46,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:43:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 18:43:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473028325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:43:47,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:43:47,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2025-03-03 18:43:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333528061] [2025-03-03 18:43:47,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:43:47,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 18:43:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:47,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 18:43:47,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-03-03 18:43:47,379 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-03 18:43:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:50,653 INFO L93 Difference]: Finished difference Result 427 states and 591 transitions. [2025-03-03 18:43:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 18:43:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) Word has length 106 [2025-03-03 18:43:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:50,656 INFO L225 Difference]: With dead ends: 427 [2025-03-03 18:43:50,656 INFO L226 Difference]: Without dead ends: 331 [2025-03-03 18:43:50,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=531, Invalid=2439, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 18:43:50,658 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1405 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:50,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 1017 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 18:43:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-03 18:43:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 179. [2025-03-03 18:43:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 248 transitions. [2025-03-03 18:43:50,677 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 248 transitions. Word has length 106 [2025-03-03 18:43:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:50,678 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 248 transitions. [2025-03-03 18:43:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 7 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-03 18:43:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 248 transitions. [2025-03-03 18:43:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 18:43:50,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:50,679 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:50,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:43:50,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 18:43:50,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 687139041, now seen corresponding path program 1 times [2025-03-03 18:43:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561180336] [2025-03-03 18:43:50,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:50,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:50,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561180336] [2025-03-03 18:43:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561180336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:43:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755605570] [2025-03-03 18:43:51,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:51,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:51,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:43:51,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:51,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:51,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:51,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:51,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 18:43:51,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 18:43:51,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:43:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755605570] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 18:43:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:43:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10] total 18 [2025-03-03 18:43:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879228417] [2025-03-03 18:43:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:52,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:43:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:52,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:43:52,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:43:52,202 INFO L87 Difference]: Start difference. First operand 179 states and 248 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:52,979 INFO L93 Difference]: Finished difference Result 495 states and 692 transitions. [2025-03-03 18:43:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:43:52,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2025-03-03 18:43:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:52,982 INFO L225 Difference]: With dead ends: 495 [2025-03-03 18:43:52,982 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 18:43:52,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:43:52,983 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 212 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:52,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 426 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:43:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 18:43:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 198. [2025-03-03 18:43:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 159 states have (on average 1.371069182389937) internal successors, (218), 159 states have internal predecessors, (218), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 278 transitions. [2025-03-03 18:43:53,004 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 278 transitions. Word has length 106 [2025-03-03 18:43:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:53,005 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 278 transitions. [2025-03-03 18:43:53,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 278 transitions. [2025-03-03 18:43:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 18:43:53,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:53,006 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:53,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:43:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:53,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -450845928, now seen corresponding path program 1 times [2025-03-03 18:43:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086554304] [2025-03-03 18:43:53,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:53,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:53,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:53,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:53,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086554304] [2025-03-03 18:43:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086554304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:43:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073681153] [2025-03-03 18:43:53,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:53,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:53,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:53,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:53,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:43:53,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 18:43:53,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 18:43:53,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:53,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:53,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 18:43:53,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:54,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:43:54,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073681153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:54,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:43:54,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-03 18:43:54,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052197066] [2025-03-03 18:43:54,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:54,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:43:54,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:54,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:43:54,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:43:54,418 INFO L87 Difference]: Start difference. First operand 198 states and 278 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:54,738 INFO L93 Difference]: Finished difference Result 489 states and 685 transitions. [2025-03-03 18:43:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:43:54,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2025-03-03 18:43:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:54,740 INFO L225 Difference]: With dead ends: 489 [2025-03-03 18:43:54,741 INFO L226 Difference]: Without dead ends: 294 [2025-03-03 18:43:54,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:43:54,742 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 130 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:54,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 432 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:43:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-03 18:43:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 231. [2025-03-03 18:43:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 192 states have (on average 1.3854166666666667) internal successors, (266), 192 states have internal predecessors, (266), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2025-03-03 18:43:54,762 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 106 [2025-03-03 18:43:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:54,763 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2025-03-03 18:43:54,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2025-03-03 18:43:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 18:43:54,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:54,764 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:54,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 18:43:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:54,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:54,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1501920192, now seen corresponding path program 1 times [2025-03-03 18:43:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700874191] [2025-03-03 18:43:54,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:54,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:54,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 18:43:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 18:43:55,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:55,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:43:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177057385] [2025-03-03 18:43:55,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:55,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 18:43:55,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 18:43:55,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 18:43:55,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:55,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:55,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 18:43:55,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:43:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-03 18:43:55,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:43:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 18:43:55,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700874191] [2025-03-03 18:43:55,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:43:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177057385] [2025-03-03 18:43:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177057385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:43:55,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:43:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-03 18:43:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494347730] [2025-03-03 18:43:55,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:43:55,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:43:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:55,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:43:55,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:43:55,654 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 18:43:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:56,265 INFO L93 Difference]: Finished difference Result 629 states and 866 transitions. [2025-03-03 18:43:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:43:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 108 [2025-03-03 18:43:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:56,270 INFO L225 Difference]: With dead ends: 629 [2025-03-03 18:43:56,270 INFO L226 Difference]: Without dead ends: 401 [2025-03-03 18:43:56,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:43:56,272 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 168 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:56,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 490 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:43:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-03 18:43:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 298. [2025-03-03 18:43:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 257 states have (on average 1.3929961089494163) internal successors, (358), 257 states have internal predecessors, (358), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 418 transitions. [2025-03-03 18:43:56,299 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 418 transitions. Word has length 108 [2025-03-03 18:43:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:56,300 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 418 transitions. [2025-03-03 18:43:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 18:43:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 418 transitions. [2025-03-03 18:43:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 18:43:56,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:56,301 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:56,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 18:43:56,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:56,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:56,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 111185079, now seen corresponding path program 1 times [2025-03-03 18:43:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513002345] [2025-03-03 18:43:56,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:56,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 18:43:56,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 18:43:56,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:56,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:56,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513002345] [2025-03-03 18:43:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513002345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:43:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347746467] [2025-03-03 18:43:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:56,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:43:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:56,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:43:56,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:43:56,549 INFO L87 Difference]: Start difference. First operand 298 states and 418 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:56,665 INFO L93 Difference]: Finished difference Result 585 states and 811 transitions. [2025-03-03 18:43:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:43:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-03-03 18:43:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:56,669 INFO L225 Difference]: With dead ends: 585 [2025-03-03 18:43:56,669 INFO L226 Difference]: Without dead ends: 406 [2025-03-03 18:43:56,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:43:56,671 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:56,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 170 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:43:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-03 18:43:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 271. [2025-03-03 18:43:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.373913043478261) internal successors, (316), 230 states have internal predecessors, (316), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 376 transitions. [2025-03-03 18:43:56,691 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 376 transitions. Word has length 108 [2025-03-03 18:43:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:56,691 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 376 transitions. [2025-03-03 18:43:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 376 transitions. [2025-03-03 18:43:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 18:43:56,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:56,692 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:56,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:43:56,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:56,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:56,693 INFO L85 PathProgramCache]: Analyzing trace with hash 334211065, now seen corresponding path program 1 times [2025-03-03 18:43:56,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:56,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033658799] [2025-03-03 18:43:56,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:56,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:56,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 18:43:56,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 18:43:56,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:56,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033658799] [2025-03-03 18:43:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033658799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:56,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:56,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:43:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086284378] [2025-03-03 18:43:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:56,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:43:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:56,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:43:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:43:56,927 INFO L87 Difference]: Start difference. First operand 271 states and 376 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:57,205 INFO L93 Difference]: Finished difference Result 788 states and 1069 transitions. [2025-03-03 18:43:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:43:57,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2025-03-03 18:43:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:57,208 INFO L225 Difference]: With dead ends: 788 [2025-03-03 18:43:57,208 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 18:43:57,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:43:57,209 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 137 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:57,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 350 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:43:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 18:43:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 286. [2025-03-03 18:43:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 245 states have (on average 1.3877551020408163) internal successors, (340), 245 states have internal predecessors, (340), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2025-03-03 18:43:57,227 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 108 [2025-03-03 18:43:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:57,227 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2025-03-03 18:43:57,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2025-03-03 18:43:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 18:43:57,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:57,228 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:57,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:43:57,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:57,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 412077920, now seen corresponding path program 1 times [2025-03-03 18:43:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:57,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141959021] [2025-03-03 18:43:57,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:43:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:43:57,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:57,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141959021] [2025-03-03 18:43:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141959021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:43:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949056680] [2025-03-03 18:43:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:58,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:43:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:58,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:43:58,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:43:58,329 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:59,184 INFO L93 Difference]: Finished difference Result 703 states and 977 transitions. [2025-03-03 18:43:59,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:43:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-03-03 18:43:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:59,187 INFO L225 Difference]: With dead ends: 703 [2025-03-03 18:43:59,187 INFO L226 Difference]: Without dead ends: 420 [2025-03-03 18:43:59,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:43:59,188 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 318 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:59,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 381 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:43:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-03 18:43:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 350. [2025-03-03 18:43:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 309 states have (on average 1.3915857605177993) internal successors, (430), 309 states have internal predecessors, (430), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:43:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2025-03-03 18:43:59,209 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 109 [2025-03-03 18:43:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:59,211 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2025-03-03 18:43:59,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2025-03-03 18:43:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 18:43:59,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:59,212 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:59,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:43:59,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:59,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 635103906, now seen corresponding path program 1 times [2025-03-03 18:43:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498630936] [2025-03-03 18:43:59,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:59,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:43:59,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:43:59,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:59,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:43:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 18:43:59,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:43:59,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498630936] [2025-03-03 18:43:59,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498630936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:43:59,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:43:59,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:43:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818416281] [2025-03-03 18:43:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:43:59,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:43:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:43:59,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:43:59,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:43:59,388 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:43:59,704 INFO L93 Difference]: Finished difference Result 1027 states and 1431 transitions. [2025-03-03 18:43:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:43:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-03-03 18:43:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:43:59,708 INFO L225 Difference]: With dead ends: 1027 [2025-03-03 18:43:59,708 INFO L226 Difference]: Without dead ends: 680 [2025-03-03 18:43:59,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:43:59,709 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 127 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:43:59,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 412 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:43:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-03 18:43:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 574. [2025-03-03 18:43:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 493 states have (on average 1.3488843813387423) internal successors, (665), 493 states have internal predecessors, (665), 60 states have call successors, (60), 20 states have call predecessors, (60), 20 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 18:43:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 785 transitions. [2025-03-03 18:43:59,749 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 785 transitions. Word has length 109 [2025-03-03 18:43:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:43:59,749 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 785 transitions. [2025-03-03 18:43:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 18:43:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 785 transitions. [2025-03-03 18:43:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 18:43:59,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:43:59,751 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:43:59,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:43:59,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:43:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:43:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 841310269, now seen corresponding path program 1 times [2025-03-03 18:43:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:43:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579401042] [2025-03-03 18:43:59,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:43:59,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:43:59,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:43:59,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:43:59,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:43:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309655488] [2025-03-03 18:43:59,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:43:59,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:43:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:43:59,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:43:59,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 18:43:59,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:44:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:44:00,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:44:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:44:00,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:44:00,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 18:44:00,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 18:44:00,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:44:00,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:44:00,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:44:00,256 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:44:00,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:44:00,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 18:44:00,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:44:00,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:44:00,508 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:44:00,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:44:00 BoogieIcfgContainer [2025-03-03 18:44:00,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:44:00,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:44:00,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:44:00,513 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:44:00,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:43:38" (3/4) ... [2025-03-03 18:44:00,515 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:44:00,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:44:00,516 INFO L158 Benchmark]: Toolchain (without parser) took 23027.79ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 109.5MB in the beginning and 146.5MB in the end (delta: -37.0MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. [2025-03-03 18:44:00,516 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:44:00,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.96ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.7MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:44:00,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.91ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:44:00,517 INFO L158 Benchmark]: Boogie Preprocessor took 32.60ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:44:00,518 INFO L158 Benchmark]: IcfgBuilder took 447.42ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 69.4MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:44:00,518 INFO L158 Benchmark]: TraceAbstraction took 22338.77ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 69.4MB in the beginning and 146.6MB in the end (delta: -77.2MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2025-03-03 18:44:00,518 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 385.9MB. Free memory was 146.6MB in the beginning and 146.5MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:44:00,519 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.37ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.96ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.7MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.91ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.60ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 447.42ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 69.4MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22338.77ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 69.4MB in the beginning and 146.6MB in the end (delta: -77.2MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 385.9MB. Free memory was 146.6MB in the beginning and 146.5MB in the end (delta: 120.0kB). 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 shiftLeft at line 51, overapproximation of shiftLeft at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L109] last_1_var_1_10 = var_1_10 [L110] last_1_var_1_12 = var_1_12 [L111] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET updateLastVariables() [L122] CALL updateVariables() [L84] var_1_3 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L87] var_1_5 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L88] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] var_1_6 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L96] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L97] var_1_8 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L98] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L99] var_1_9 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L100] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L103] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L103] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L104] var_1_15 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L105] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L106] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L106] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L122] RET updateVariables() [L123] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L45] COND TRUE var_1_6 <= (last_1_var_1_12 + var_1_7) [L46] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L50] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L60] COND FALSE !((- var_1_9) <= var_1_8) [L73] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L75] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L75] COND FALSE !((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114-L115] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2979 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2972 mSDsluCounter, 4224 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3162 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4439 IncrementalHoareTripleChecker+Invalid, 4683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 1062 mSDtfsCounter, 4439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 939 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=10, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1036 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1903 ConstructedInterpolants, 0 QuantifiedInterpolants, 8966 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 7287/7560 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:44:00,563 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/21.0.5-tem/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.6.800.v20240513-1750.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_codestructure_dependencies_file-9.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 c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:44:02,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:44:02,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:44:02,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:44:02,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:44:02,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:44:02,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:44:02,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:44:02,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:44:02,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:44:02,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:44:02,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:44:02,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:44:02,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:44:02,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:44:02,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:44:02,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:44:02,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:44:02,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:44:02,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:44:02,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:44:02,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:44:02,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:44:02,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:44:02,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:44:02,475 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2025-03-03 18:44:02,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:44:02,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:44:02,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:44:02,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:44:02,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:44:02,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-03-03 18:44:03,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282922507/09953f44d9f24c1ba4367d17d4e27397/FLAGa703944e5 [2025-03-03 18:44:04,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:44:04,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2025-03-03 18:44:04,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282922507/09953f44d9f24c1ba4367d17d4e27397/FLAGa703944e5 [2025-03-03 18:44:04,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282922507/09953f44d9f24c1ba4367d17d4e27397 [2025-03-03 18:44:04,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:44:04,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:44:04,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:44:04,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:44:04,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:44:04,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c104e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04, skipping insertion in model container [2025-03-03 18:44:04,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:44:04,191 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_codestructure_dependencies_file-9.i[918,931] [2025-03-03 18:44:04,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:44:04,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:44:04,259 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_codestructure_dependencies_file-9.i[918,931] [2025-03-03 18:44:04,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:44:04,293 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:44:04,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04 WrapperNode [2025-03-03 18:44:04,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:44:04,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:44:04,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:44:04,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:44:04,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,332 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-03 18:44:04,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:44:04,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:44:04,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:44:04,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:44:04,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,350 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]. [2025-03-03 18:44:04,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:44:04,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:44:04,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:44:04,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:44:04,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (1/1) ... [2025-03-03 18:44:04,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:44:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:44:04,396 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) [2025-03-03 18:44:04,398 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 [2025-03-03 18:44:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:44:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:44:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:44:04,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:44:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:44:04,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:44:04,471 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:44:04,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:44:04,774 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:44:04,775 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:44:04,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:44:04,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:44:04,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:44:04 BoogieIcfgContainer [2025-03-03 18:44:04,782 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:44:04,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:44:04,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:44:04,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:44:04,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:44:04" (1/3) ... [2025-03-03 18:44:04,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696e5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:44:04, skipping insertion in model container [2025-03-03 18:44:04,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:44:04" (2/3) ... [2025-03-03 18:44:04,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696e5c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:44:04, skipping insertion in model container [2025-03-03 18:44:04,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:44:04" (3/3) ... [2025-03-03 18:44:04,789 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2025-03-03 18:44:04,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:44:04,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-9.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:44:04,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:44:04,848 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;@391c4356, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:44:04,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:44:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:44:04,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 18:44:04,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:44:04,860 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:44:04,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:44:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:44:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -505723850, now seen corresponding path program 1 times [2025-03-03 18:44:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:44:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211055638] [2025-03-03 18:44:04,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:44:04,871 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 [2025-03-03 18:44:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:44:04,875 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) [2025-03-03 18:44:04,876 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 [2025-03-03 18:44:04,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 18:44:05,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 18:44:05,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:44:05,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:44:05,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:44:05,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:44:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 18:44:05,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:44:05,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:44:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211055638] [2025-03-03 18:44:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211055638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:44:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:44:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:44:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841098287] [2025-03-03 18:44:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:44:05,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:44:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:44:05,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:44:05,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:44:05,116 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:44:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:44:05,135 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2025-03-03 18:44:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:44:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2025-03-03 18:44:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:44:05,144 INFO L225 Difference]: With dead ends: 98 [2025-03-03 18:44:05,144 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 18:44:05,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:44:05,150 INFO L435 NwaCegarLoop]: 72 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, 72 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 [2025-03-03 18:44:05,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:44:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 18:44:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 18:44:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 18:44:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-03-03 18:44:05,184 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 98 [2025-03-03 18:44:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:44:05,184 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-03-03 18:44:05,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 18:44:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-03-03 18:44:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 18:44:05,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:44:05,189 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:44:05,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 18:44:05,390 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 [2025-03-03 18:44:05,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:44:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:44:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1767961136, now seen corresponding path program 1 times [2025-03-03 18:44:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:44:05,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706219079] [2025-03-03 18:44:05,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:44:05,391 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 [2025-03-03 18:44:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:44:05,399 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) [2025-03-03 18:44:05,400 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 [2025-03-03 18:44:05,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:44:05,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:44:05,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:44:05,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:44:05,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 18:44:05,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:44:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 48 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 18:44:06,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:44:07,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:44:07,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706219079] [2025-03-03 18:44:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706219079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:44:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2090319610] [2025-03-03 18:44:07,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:44:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 18:44:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 18:44:07,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 18:44:07,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 18:44:07,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:44:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:44:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:44:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:44:07,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 18:44:07,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:44:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-03 18:44:07,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:44:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2090319610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:44:08,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:44:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2025-03-03 18:44:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479491991] [2025-03-03 18:44:08,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:44:08,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:44:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:44:08,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:44:08,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:44:08,308 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 18:44:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:44:08,932 INFO L93 Difference]: Finished difference Result 152 states and 219 transitions. [2025-03-03 18:44:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:44:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 99 [2025-03-03 18:44:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:44:08,940 INFO L225 Difference]: With dead ends: 152 [2025-03-03 18:44:08,940 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 18:44:08,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=418, Unknown=0, NotChecked=0, Total=650 [2025-03-03 18:44:08,941 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:44:08,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 363 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:44:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 18:44:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2025-03-03 18:44:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:44:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2025-03-03 18:44:08,957 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 99 [2025-03-03 18:44:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:44:08,959 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2025-03-03 18:44:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 18:44:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2025-03-03 18:44:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 18:44:08,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:44:08,960 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:44:08,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:44:09,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:44:09,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:44:09,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:44:09,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:44:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -730054801, now seen corresponding path program 1 times [2025-03-03 18:44:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:44:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312882515] [2025-03-03 18:44:09,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:44:09,361 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 [2025-03-03 18:44:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:44:09,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:44:09,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 18:44:09,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 18:44:09,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 18:44:09,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:44:09,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:44:09,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 18:44:09,477 INFO L279 TraceCheckSpWp]: Computing forward predicates...