./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-50.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 8b83130475efd7822e49453315feedadade357f80d31bad75ec4850fe7860f1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:09:23,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:09:23,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:09:23,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:09:23,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:09:23,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:09:23,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:09:23,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:09:23,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:09:23,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:09:23,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:09:23,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:09:23,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:09:23,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:09:23,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:09:23,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:09:23,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:09:23,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:09:23,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:09:23,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:09:23,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:09:23,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:09:23,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:09:23,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:09:23,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:09:23,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:09:23,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:09:23,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:09:23,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:09:23,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:09:23,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:09:23,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:09:23,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:09:23,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:09:23,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:09:23,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:09:23,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:09:23,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:09:23,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:09:23,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:09:23,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:09:23,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:09:23,291 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b83130475efd7822e49453315feedadade357f80d31bad75ec4850fe7860f1f [2024-11-10 08:09:23,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:09:23,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:09:23,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:09:23,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:09:23,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:09:23,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-50.i [2024-11-10 08:09:24,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:09:25,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:09:25,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-50.i [2024-11-10 08:09:25,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ba67bbc/60c2d123387046c9a01188c81b85efc2/FLAGa6e0435a1 [2024-11-10 08:09:25,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ba67bbc/60c2d123387046c9a01188c81b85efc2 [2024-11-10 08:09:25,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:09:25,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:09:25,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:09:25,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:09:25,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:09:25,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbff249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25, skipping insertion in model container [2024-11-10 08:09:25,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:09:25,606 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_operatoramount_amount100_file-50.i[916,929] [2024-11-10 08:09:25,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:09:25,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:09:25,709 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_operatoramount_amount100_file-50.i[916,929] [2024-11-10 08:09:25,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:09:25,762 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:09:25,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25 WrapperNode [2024-11-10 08:09:25,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:09:25,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:09:25,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:09:25,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:09:25,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,834 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2024-11-10 08:09:25,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:09:25,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:09:25,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:09:25,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:09:25,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:09:25,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:09:25,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:09:25,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:09:25,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:09:25,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (1/1) ... [2024-11-10 08:09:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:09:25,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:09:25,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:09:25,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:09:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:09:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:09:25,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:09:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:09:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:09:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:09:26,088 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:09:26,090 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:09:26,578 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc property_#t~bitwise28#1;havoc property_#t~short29#1;havoc property_#t~bitwise30#1;havoc property_#t~short31#1;havoc property_#t~short32#1; [2024-11-10 08:09:26,618 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-10 08:09:26,618 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:09:26,638 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:09:26,639 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:09:26,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:09:26 BoogieIcfgContainer [2024-11-10 08:09:26,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:09:26,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:09:26,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:09:26,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:09:26,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:09:25" (1/3) ... [2024-11-10 08:09:26,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afcc359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:09:26, skipping insertion in model container [2024-11-10 08:09:26,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:09:25" (2/3) ... [2024-11-10 08:09:26,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afcc359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:09:26, skipping insertion in model container [2024-11-10 08:09:26,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:09:26" (3/3) ... [2024-11-10 08:09:26,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-50.i [2024-11-10 08:09:26,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:09:26,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:09:26,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:09:26,719 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;@330e1415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:09:26,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:09:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 08:09:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-10 08:09:26,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:09:26,741 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:09:26,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:09:26,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:09:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1320821081, now seen corresponding path program 1 times [2024-11-10 08:09:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:09:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983239834] [2024-11-10 08:09:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:09:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:09:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:09:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:09:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:09:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:09:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:09:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:09:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:09:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:09:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:09:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:09:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:09:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:09:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:09:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:09:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:09:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:09:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:09:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:09:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 08:09:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:09:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:09:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:09:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:09:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 08:09:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:09:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 08:09:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 08:09:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 08:09:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 08:09:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 08:09:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 08:09:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 08:09:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 08:09:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 08:09:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 08:09:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 08:09:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-10 08:09:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 08:09:27,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:09:27,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983239834] [2024-11-10 08:09:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983239834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:09:27,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:09:27,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:09:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017324153] [2024-11-10 08:09:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:09:27,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:09:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:09:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:09:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:09:27,249 INFO L87 Difference]: Start difference. First operand has 128 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-10 08:09:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:09:27,286 INFO L93 Difference]: Finished difference Result 248 states and 420 transitions. [2024-11-10 08:09:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:09:27,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 245 [2024-11-10 08:09:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:09:27,300 INFO L225 Difference]: With dead ends: 248 [2024-11-10 08:09:27,300 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 08:09:27,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:09:27,308 INFO L432 NwaCegarLoop]: 183 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, 183 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 [2024-11-10 08:09:27,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:09:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 08:09:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 08:09:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 08:09:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2024-11-10 08:09:27,359 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 245 [2024-11-10 08:09:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:09:27,359 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2024-11-10 08:09:27,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-10 08:09:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2024-11-10 08:09:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-10 08:09:27,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:09:27,364 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:09:27,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:09:27,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:09:27,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:09:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash 392136180, now seen corresponding path program 1 times [2024-11-10 08:09:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:09:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261909450] [2024-11-10 08:09:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:09:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:09:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:09:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:09:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:09:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:09:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:09:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:09:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:09:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:09:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:09:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:09:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:09:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:09:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:09:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:09:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:09:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:09:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:09:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:09:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 08:09:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:09:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:09:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:09:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:09:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 08:09:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:09:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 08:09:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 08:09:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 08:09:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 08:09:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 08:09:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 08:09:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 08:09:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 08:09:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 08:09:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 08:09:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 08:09:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-10 08:09:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-10 08:09:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:09:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261909450] [2024-11-10 08:09:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261909450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:09:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:09:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:09:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527461591] [2024-11-10 08:09:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:09:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:09:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:09:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:09:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:09:28,374 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 08:09:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:09:28,576 INFO L93 Difference]: Finished difference Result 243 states and 371 transitions. [2024-11-10 08:09:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:09:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 245 [2024-11-10 08:09:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:09:28,579 INFO L225 Difference]: With dead ends: 243 [2024-11-10 08:09:28,579 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 08:09:28,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:09:28,580 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:09:28,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 170 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:09:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 08:09:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 08:09:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 08:09:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2024-11-10 08:09:28,600 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 183 transitions. Word has length 245 [2024-11-10 08:09:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:09:28,601 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 183 transitions. [2024-11-10 08:09:28,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-10 08:09:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2024-11-10 08:09:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-10 08:09:28,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:09:28,604 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:09:28,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:09:28,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:09:28,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:09:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 546422612, now seen corresponding path program 1 times [2024-11-10 08:09:28,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:09:28,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862282485] [2024-11-10 08:09:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:09:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:09:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:09:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:09:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:09:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:09:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:09:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:09:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:09:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:09:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:09:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 08:09:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:09:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:09:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:09:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:09:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:09:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:09:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:09:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:09:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 08:09:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:09:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:09:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:09:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:09:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 08:09:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:09:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 08:09:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 08:09:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 08:09:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 08:09:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 08:09:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 08:09:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 08:09:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 08:09:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 08:09:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 08:09:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 08:09:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-10 08:09:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-10 08:09:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:09:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862282485] [2024-11-10 08:09:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862282485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:09:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968154590] [2024-11-10 08:09:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:09:29,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:09:29,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:09:29,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:09:29,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 08:09:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:29,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:09:29,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:09:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 438 proven. 99 refuted. 0 times theorem prover too weak. 2127 trivial. 0 not checked. [2024-11-10 08:09:29,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:09:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-10 08:09:30,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968154590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:09:30,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:09:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-11-10 08:09:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501170370] [2024-11-10 08:09:30,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:09:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 08:09:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:09:30,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 08:09:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:09:30,178 INFO L87 Difference]: Start difference. First operand 123 states and 183 transitions. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 3 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2024-11-10 08:09:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:09:30,700 INFO L93 Difference]: Finished difference Result 251 states and 371 transitions. [2024-11-10 08:09:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 08:09:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 3 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 245 [2024-11-10 08:09:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:09:30,703 INFO L225 Difference]: With dead ends: 251 [2024-11-10 08:09:30,703 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 08:09:30,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-10 08:09:30,705 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 306 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:09:30,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 801 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:09:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 08:09:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2024-11-10 08:09:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-10 08:09:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-10 08:09:30,722 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 245 [2024-11-10 08:09:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:09:30,723 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-10 08:09:30,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 3 states have call successors, (103), 2 states have call predecessors, (103), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2024-11-10 08:09:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-10 08:09:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-10 08:09:30,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:09:30,726 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:09:30,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 08:09:30,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:09:30,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:09:30,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:09:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1593696250, now seen corresponding path program 1 times [2024-11-10 08:09:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:09:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527767801] [2024-11-10 08:09:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:09:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:09:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:09:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204581010] [2024-11-10 08:09:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:09:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:09:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:09:31,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:09:31,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 08:09:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:09:31,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 08:09:31,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:09:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1376 proven. 228 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2024-11-10 08:09:36,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:09:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:09:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527767801] [2024-11-10 08:09:51,095 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 08:09:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204581010] [2024-11-10 08:09:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204581010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:09:51,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:09:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-10 08:09:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243545517] [2024-11-10 08:09:51,095 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 08:09:51,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 08:09:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:09:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 08:09:51,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=242, Unknown=4, NotChecked=0, Total=342 [2024-11-10 08:09:51,097 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 4 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-10 08:09:57,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:05,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:09,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:14,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:18,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:22,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:26,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:30,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:34,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:38,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:42,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:46,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:50,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:55,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:10:59,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:11:03,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 08:11:07,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]