./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-88.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8150f4075ff7ed6684370ffcd207738cd41bd04af34fe0315c0cb7e604ed64b7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:30:34,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:30:34,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:30:34,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:30:34,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:30:34,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:30:34,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:30:34,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:30:34,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:30:34,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:30:34,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:30:34,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:30:34,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:30:34,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:30:34,779 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:30:34,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:30:34,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:30:34,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:30:34,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:30:34,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:30:34,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:30:34,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:30:34,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:30:34,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:30:34,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:30:34,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:30:34,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:30:34,785 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:30:34,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:30:34,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:30:34,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:30:34,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:30:34,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:30:34,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:30:34,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:30:34,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:30:34,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:30:34,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:30:34,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:30:34,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:30:34,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:30:34,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:30:34,789 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-clean/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-clean/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 -> 8150f4075ff7ed6684370ffcd207738cd41bd04af34fe0315c0cb7e604ed64b7 [2024-10-11 12:30:35,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:30:35,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:30:35,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:30:35,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:30:35,048 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:30:35,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-88.i [2024-10-11 12:30:36,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:30:36,650 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:30:36,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-88.i [2024-10-11 12:30:36,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34f4c4601/6236c362f0e64570aac4ff7037fcc8b0/FLAG62815958d [2024-10-11 12:30:36,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34f4c4601/6236c362f0e64570aac4ff7037fcc8b0 [2024-10-11 12:30:36,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:30:36,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:30:36,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:30:36,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:30:36,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:30:36,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:30:36" (1/1) ... [2024-10-11 12:30:36,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281e76e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:36, skipping insertion in model container [2024-10-11 12:30:36,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:30:36" (1/1) ... [2024-10-11 12:30:36,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:30:36,902 WARN L248 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_amount250_file-88.i[916,929] [2024-10-11 12:30:37,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:30:37,113 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:30:37,126 WARN L248 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_amount250_file-88.i[916,929] [2024-10-11 12:30:37,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:30:37,208 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:30:37,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37 WrapperNode [2024-10-11 12:30:37,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:30:37,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:30:37,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:30:37,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:30:37,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,322 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 405 [2024-10-11 12:30:37,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:30:37,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:30:37,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:30:37,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:30:37,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,409 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-10-11 12:30:37,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:30:37,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:30:37,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:30:37,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:30:37,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (1/1) ... [2024-10-11 12:30:37,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:30:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:30:37,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:30:37,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:30:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:30:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:30:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:30:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:30:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:30:37,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:30:37,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:30:37,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:30:38,498 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-11 12:30:38,499 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:30:38,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:30:38,538 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:30:38,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:38 BoogieIcfgContainer [2024-10-11 12:30:38,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:30:38,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:30:38,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:30:38,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:30:38,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:30:36" (1/3) ... [2024-10-11 12:30:38,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da9e068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:30:38, skipping insertion in model container [2024-10-11 12:30:38,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:37" (2/3) ... [2024-10-11 12:30:38,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da9e068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:30:38, skipping insertion in model container [2024-10-11 12:30:38,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:38" (3/3) ... [2024-10-11 12:30:38,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-88.i [2024-10-11 12:30:38,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:30:38,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:30:38,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:30:38,632 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;@24604630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:30:38,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:30:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 123 states have (on average 1.5447154471544715) internal successors, (190), 124 states have internal predecessors, (190), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:30:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 12:30:38,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:30:38,655 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:30:38,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:30:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:30:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1974092054, now seen corresponding path program 1 times [2024-10-11 12:30:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:30:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477069334] [2024-10-11 12:30:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:30:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:30:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:30:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:30:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:30:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:30:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:30:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:30:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:30:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:30:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:30:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:30:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:30:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 12:30:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:30:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 12:30:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:30:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 12:30:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 12:30:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 12:30:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:30:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 12:30:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:30:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:30:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 12:30:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 12:30:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 12:30:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 12:30:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 12:30:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 12:30:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 12:30:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 12:30:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 12:30:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 12:30:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 12:30:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 12:30:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 12:30:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:30:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477069334] [2024-10-11 12:30:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477069334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:30:39,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:30:39,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:30:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197843912] [2024-10-11 12:30:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:30:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:30:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:30:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:30:39,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:30:39,360 INFO L87 Difference]: Start difference. First operand has 160 states, 123 states have (on average 1.5447154471544715) internal successors, (190), 124 states have internal predecessors, (190), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 12:30:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:30:39,426 INFO L93 Difference]: Finished difference Result 317 states and 548 transitions. [2024-10-11 12:30:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:30:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 240 [2024-10-11 12:30:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:30:39,441 INFO L225 Difference]: With dead ends: 317 [2024-10-11 12:30:39,442 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 12:30:39,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:30:39,453 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:30:39,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:30:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 12:30:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-10-11 12:30:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.5163934426229508) internal successors, (185), 122 states have internal predecessors, (185), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:30:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 253 transitions. [2024-10-11 12:30:39,510 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 253 transitions. Word has length 240 [2024-10-11 12:30:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:30:39,511 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 253 transitions. [2024-10-11 12:30:39,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 12:30:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 253 transitions. [2024-10-11 12:30:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 12:30:39,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:30:39,517 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:30:39,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:30:39,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:30:39,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:30:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1826213146, now seen corresponding path program 1 times [2024-10-11 12:30:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:30:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109456544] [2024-10-11 12:30:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:30:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:30:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:30:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:30:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:30:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:30:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:30:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:30:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:30:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:30:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:30:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:30:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:30:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 12:30:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:30:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 12:30:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:30:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 12:30:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 12:30:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 12:30:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 12:30:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 12:30:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 12:30:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 12:30:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 12:30:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 12:30:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 12:30:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 12:30:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 12:30:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 12:30:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 12:30:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 12:30:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 12:30:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 12:30:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 12:30:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 12:30:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:30:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 12:30:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:30:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109456544] [2024-10-11 12:30:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109456544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:30:39,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:30:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:30:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666762202] [2024-10-11 12:30:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:30:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:30:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:30:39,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:30:39,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:30:39,952 INFO L87 Difference]: Start difference. First operand 158 states and 253 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 12:30:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:30:40,094 INFO L93 Difference]: Finished difference Result 401 states and 643 transitions. [2024-10-11 12:30:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:30:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 240 [2024-10-11 12:30:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:30:40,099 INFO L225 Difference]: With dead ends: 401 [2024-10-11 12:30:40,099 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 12:30:40,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:30:40,103 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 120 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:30:40,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 451 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:30:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 12:30:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2024-10-11 12:30:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 201 states have (on average 1.5174129353233832) internal successors, (305), 201 states have internal predecessors, (305), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:30:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 373 transitions. [2024-10-11 12:30:40,123 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 373 transitions. Word has length 240 [2024-10-11 12:30:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:30:40,125 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 373 transitions. [2024-10-11 12:30:40,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 12:30:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 373 transitions. [2024-10-11 12:30:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 12:30:40,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:30:40,128 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 12:30:40,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:30:40,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:30:40,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:30:40,129 INFO L85 PathProgramCache]: Analyzing trace with hash -812136938, now seen corresponding path program 1 times [2024-10-11 12:30:40,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:30:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662012577] [2024-10-11 12:30:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:30:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:30:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat