./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercode_fillercodesize_ps-cn-25_file-33.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 8be6ce3aed04a0f72fff72ce21ac27fefd98e972dd5fa46b07e62cac65a15dd5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:07:53,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:07:53,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:07:53,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:07:53,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:07:53,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:07:53,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:07:53,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:07:53,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:07:53,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:07:53,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:07:53,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:07:53,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:07:53,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:07:53,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:07:53,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:07:53,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:07:53,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:07:53,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:07:53,667 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 -> 8be6ce3aed04a0f72fff72ce21ac27fefd98e972dd5fa46b07e62cac65a15dd5 [2025-03-08 11:07:53,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:07:53,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:07:53,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:07:53,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:07:53,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:07:53,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i [2025-03-08 11:07:55,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd24939e6/a7546aabd8ec40878efe5615f28c6a01/FLAG63627ac43 [2025-03-08 11:07:55,344 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:07:55,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-33.i [2025-03-08 11:07:55,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd24939e6/a7546aabd8ec40878efe5615f28c6a01/FLAG63627ac43 [2025-03-08 11:07:55,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd24939e6/a7546aabd8ec40878efe5615f28c6a01 [2025-03-08 11:07:55,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:07:55,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:07:55,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:07:55,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:07:55,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:07:55,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55, skipping insertion in model container [2025-03-08 11:07:55,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:07:55,776 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_fillercode_fillercodesize_ps-cn-25_file-33.i[915,928] [2025-03-08 11:07:55,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:07:55,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:07:55,833 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_fillercode_fillercodesize_ps-cn-25_file-33.i[915,928] [2025-03-08 11:07:55,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:07:55,882 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:07:55,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55 WrapperNode [2025-03-08 11:07:55,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:07:55,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:07:55,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:07:55,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:07:55,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,930 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-03-08 11:07:55,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:07:55,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:07:55,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:07:55,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:07:55,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,954 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-08 11:07:55,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:07:55,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:07:55,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:07:55,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:07:55,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:07:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:07:56,004 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-08 11:07:56,009 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-08 11:07:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:07:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:07:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:07:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:07:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:07:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:07:56,085 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:07:56,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:07:56,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: havoc property_#t~ite26#1;havoc property_#t~bitwise25#1; [2025-03-08 11:07:56,443 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 11:07:56,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:07:56,456 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:07:56,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:07:56,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:07:56 BoogieIcfgContainer [2025-03-08 11:07:56,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:07:56,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:07:56,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:07:56,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:07:56,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:07:55" (1/3) ... [2025-03-08 11:07:56,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b36157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:07:56, skipping insertion in model container [2025-03-08 11:07:56,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (2/3) ... [2025-03-08 11:07:56,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b36157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:07:56, skipping insertion in model container [2025-03-08 11:07:56,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:07:56" (3/3) ... [2025-03-08 11:07:56,464 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-33.i [2025-03-08 11:07:56,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:07:56,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-33.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:07:56,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:07:56,521 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;@3dee3eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:07:56,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:07:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:07:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 11:07:56,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:56,533 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:07:56,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1821730053, now seen corresponding path program 1 times [2025-03-08 11:07:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724656999] [2025-03-08 11:07:56,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:56,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:07:56,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:07:56,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:56,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 11:07:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724656999] [2025-03-08 11:07:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724656999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:07:56,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29221280] [2025-03-08 11:07:56,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:56,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:07:56,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:07:56,834 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-08 11:07:56,836 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-08 11:07:56,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:07:56,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:07:56,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:56,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:56,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:07:57,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:07:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 11:07:57,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:07:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29221280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:07:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:07:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766523857] [2025-03-08 11:07:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:07:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:57,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:07:57,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:07:57,057 INFO L87 Difference]: Start difference. First operand has 100 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:07:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:57,085 INFO L93 Difference]: Finished difference Result 194 states and 335 transitions. [2025-03-08 11:07:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:07:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2025-03-08 11:07:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:57,091 INFO L225 Difference]: With dead ends: 194 [2025-03-08 11:07:57,091 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 11:07:57,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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-08 11:07:57,096 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:07:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 11:07:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-08 11:07:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:07:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2025-03-08 11:07:57,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 204 [2025-03-08 11:07:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:57,124 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2025-03-08 11:07:57,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:07:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2025-03-08 11:07:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 11:07:57,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:57,127 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:07:57,134 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-08 11:07:57,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:07:57,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:57,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1908150459, now seen corresponding path program 1 times [2025-03-08 11:07:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:57,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475738703] [2025-03-08 11:07:57,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:57,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:07:57,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:07:57,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:57,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:07:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475738703] [2025-03-08 11:07:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475738703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:07:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:07:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892364256] [2025-03-08 11:07:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:07:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:58,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:07:58,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:07:58,188 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:07:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:58,480 INFO L93 Difference]: Finished difference Result 290 states and 446 transitions. [2025-03-08 11:07:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:07:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2025-03-08 11:07:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:58,483 INFO L225 Difference]: With dead ends: 290 [2025-03-08 11:07:58,483 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 11:07:58,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:07:58,484 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 113 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:58,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 374 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:07:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 11:07:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 182. [2025-03-08 11:07:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:07:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 281 transitions. [2025-03-08 11:07:58,511 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 281 transitions. Word has length 204 [2025-03-08 11:07:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:58,511 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 281 transitions. [2025-03-08 11:07:58,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:07:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 281 transitions. [2025-03-08 11:07:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 11:07:58,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:58,514 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:07:58,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:07:58,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1577161691, now seen corresponding path program 1 times [2025-03-08 11:07:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103468331] [2025-03-08 11:07:58,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:58,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:58,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 11:07:58,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 11:07:58,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:58,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:07:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103468331] [2025-03-08 11:07:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103468331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:58,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:07:58,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:07:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779891105] [2025-03-08 11:07:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:07:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:58,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:07:58,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:07:58,789 INFO L87 Difference]: Start difference. First operand 182 states and 281 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:07:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:58,997 INFO L93 Difference]: Finished difference Result 299 states and 457 transitions. [2025-03-08 11:07:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:07:58,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2025-03-08 11:07:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:59,000 INFO L225 Difference]: With dead ends: 299 [2025-03-08 11:07:59,000 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 11:07:59,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:07:59,001 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 110 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:59,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 379 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:07:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 11:07:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2025-03-08 11:07:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:07:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 281 transitions. [2025-03-08 11:07:59,032 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 281 transitions. Word has length 205 [2025-03-08 11:07:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:59,032 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 281 transitions. [2025-03-08 11:07:59,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:07:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 281 transitions. [2025-03-08 11:07:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 11:07:59,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:59,034 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:07:59,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:07:59,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:59,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash -184314969, now seen corresponding path program 1 times [2025-03-08 11:07:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752647101] [2025-03-08 11:07:59,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:59,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 11:07:59,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 11:07:59,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:59,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:08:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752647101] [2025-03-08 11:08:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752647101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:08:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041455009] [2025-03-08 11:08:06,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:06,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:08:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:06,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:08:06,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:08:06,570 INFO L87 Difference]: Start difference. First operand 183 states and 281 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:08:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:08,320 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2025-03-08 11:08:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:08:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2025-03-08 11:08:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:08,322 INFO L225 Difference]: With dead ends: 244 [2025-03-08 11:08:08,322 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 11:08:08,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:08:08,323 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 270 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:08,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 869 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:08:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 11:08:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 197. [2025-03-08 11:08:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:08:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 298 transitions. [2025-03-08 11:08:08,348 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 298 transitions. Word has length 206 [2025-03-08 11:08:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:08,349 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 298 transitions. [2025-03-08 11:08:08,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:08:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 298 transitions. [2025-03-08 11:08:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 11:08:08,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:08,352 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:08:08,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:08:08,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash -380828474, now seen corresponding path program 1 times [2025-03-08 11:08:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465915116] [2025-03-08 11:08:08,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:08,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 11:08:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 11:08:08,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:08,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 57 proven. 123 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-08 11:08:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465915116] [2025-03-08 11:08:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465915116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:08:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201551172] [2025-03-08 11:08:13,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:13,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:08:13,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:13,218 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-08 11:08:13,220 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-08 11:08:13,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 11:08:13,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 11:08:13,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:13,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:13,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 11:08:13,324 INFO L279 TraceCheckSpWp]: Computing forward predicates...