./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_fillercode_fillercodestructure_filler-ps-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:25:18,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:25:18,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:25:18,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:25:18,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:25:18,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:25:18,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:25:18,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:25:18,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:25:18,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:25:18,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:25:18,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:25:18,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:25:18,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:25:18,391 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:25:18,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:25:18,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:25:18,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:25:18,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:25:18,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:25:18,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:25:18,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:25:18,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:25:18,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:25:18,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:25:18,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:25:18,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:25:18,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:25:18,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:25:18,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:25:18,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:25:18,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:25:18,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:25:18,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:25:18,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:25:18,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:25:18,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:25:18,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:25:18,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:25:18,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:25:18,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:25:18,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:25:18,403 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2024-10-24 08:25:18,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:25:18,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:25:18,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:25:18,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:25:18,723 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:25:18,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-24 08:25:20,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:25:20,461 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:25:20,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-24 08:25:20,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a6a769/c6fc7b0e1dec42a4863640e52403bec7/FLAG3cb5194c4 [2024-10-24 08:25:20,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a6a769/c6fc7b0e1dec42a4863640e52403bec7 [2024-10-24 08:25:20,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:25:20,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:25:20,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:25:20,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:25:20,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:25:20,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:20,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90b181a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20, skipping insertion in model container [2024-10-24 08:25:20,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:20,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:25:20,747 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_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-10-24 08:25:20,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:25:20,847 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:25:20,858 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_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-10-24 08:25:20,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:25:20,924 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:25:20,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20 WrapperNode [2024-10-24 08:25:20,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:25:20,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:25:20,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:25:20,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:25:20,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:20,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:20,992 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-24 08:25:20,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:25:20,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:25:20,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:25:20,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:25:21,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,044 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-24 08:25:21,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:25:21,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:25:21,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:25:21,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:25:21,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (1/1) ... [2024-10-24 08:25:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:25:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:25:21,128 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-10-24 08:25:21,132 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-10-24 08:25:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:25:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:25:21,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:25:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:25:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:25:21,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:25:21,281 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:25:21,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:25:21,773 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 08:25:21,773 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:25:21,838 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:25:21,839 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:25:21,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:25:21 BoogieIcfgContainer [2024-10-24 08:25:21,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:25:21,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:25:21,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:25:21,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:25:21,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:25:20" (1/3) ... [2024-10-24 08:25:21,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51745f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:25:21, skipping insertion in model container [2024-10-24 08:25:21,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:25:20" (2/3) ... [2024-10-24 08:25:21,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51745f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:25:21, skipping insertion in model container [2024-10-24 08:25:21,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:25:21" (3/3) ... [2024-10-24 08:25:21,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-24 08:25:21,869 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:25:21,869 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:25:22,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:25:22,017 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;@27beabe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:25:22,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:25:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:25:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 08:25:22,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:25:22,042 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:25:22,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:25:22,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:25:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash -649338097, now seen corresponding path program 1 times [2024-10-24 08:25:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:25:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965934648] [2024-10-24 08:25:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:25:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:25:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:25:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:25:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:25:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:25:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:25:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:25:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:25:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:25:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:25:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:25:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:25:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:25:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:25:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:25:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:25:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:25:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:25:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:25:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:25:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:25:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:25:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:25:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:25:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:25:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:25:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:25:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965934648] [2024-10-24 08:25:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965934648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:25:22,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:25:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:25:22,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779375687] [2024-10-24 08:25:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:25:22,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:25:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:25:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:25:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:25:22,637 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:25:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:25:22,682 INFO L93 Difference]: Finished difference Result 155 states and 278 transitions. [2024-10-24 08:25:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:25:22,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-10-24 08:25:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:25:22,698 INFO L225 Difference]: With dead ends: 155 [2024-10-24 08:25:22,698 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 08:25:22,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-24 08:25:22,707 INFO L432 NwaCegarLoop]: 120 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, 120 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-24 08:25:22,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:25:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 08:25:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 08:25:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:25:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-10-24 08:25:22,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 157 [2024-10-24 08:25:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:25:22,756 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-24 08:25:22,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:25:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2024-10-24 08:25:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 08:25:22,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:25:22,761 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:25:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:25:22,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:25:22,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:25:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1055475765, now seen corresponding path program 1 times [2024-10-24 08:25:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:25:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58643576] [2024-10-24 08:25:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:25:22,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:25:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:25:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:25:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:25:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:25:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:25:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:25:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:25:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:25:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:25:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:25:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:25:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:25:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:25:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:25:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:25:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:25:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:25:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:25:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:25:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:25:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:25:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:25:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:25:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:25:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:25:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:25:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58643576] [2024-10-24 08:25:23,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58643576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:25:23,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:25:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:25:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601052439] [2024-10-24 08:25:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:25:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:25:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:25:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:25:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:25:23,248 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:25:23,335 INFO L93 Difference]: Finished difference Result 229 states and 367 transitions. [2024-10-24 08:25:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:25:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-24 08:25:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:25:23,340 INFO L225 Difference]: With dead ends: 229 [2024-10-24 08:25:23,340 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 08:25:23,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-24 08:25:23,342 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 80 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:25:23,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:25:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 08:25:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-24 08:25:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.47) internal successors, (147), 100 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 08:25:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 243 transitions. [2024-10-24 08:25:23,386 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 243 transitions. Word has length 157 [2024-10-24 08:25:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:25:23,387 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 243 transitions. [2024-10-24 08:25:23,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2024-10-24 08:25:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 08:25:23,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:25:23,393 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:25:23,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:25:23,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:25:23,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:25:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1873124215, now seen corresponding path program 1 times [2024-10-24 08:25:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:25:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564968705] [2024-10-24 08:25:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:25:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:25:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:25:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:25:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:25:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:25:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:25:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:25:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:25:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:25:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:25:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:25:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:25:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:25:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:25:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:25:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:25:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:25:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:25:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:25:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:25:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:25:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:25:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:25:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:25:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:25:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:25:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:25:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564968705] [2024-10-24 08:25:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564968705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:25:23,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:25:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:25:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105533580] [2024-10-24 08:25:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:25:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:25:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:25:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:25:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:25:23,992 INFO L87 Difference]: Start difference. First operand 151 states and 243 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:25:24,485 INFO L93 Difference]: Finished difference Result 547 states and 884 transitions. [2024-10-24 08:25:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:25:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-24 08:25:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:25:24,494 INFO L225 Difference]: With dead ends: 547 [2024-10-24 08:25:24,497 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 08:25:24,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-10-24 08:25:24,500 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 203 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:25:24,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 402 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:25:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 08:25:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2024-10-24 08:25:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 216 states have (on average 1.412037037037037) internal successors, (305), 216 states have internal predecessors, (305), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 08:25:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 545 transitions. [2024-10-24 08:25:24,580 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 545 transitions. Word has length 157 [2024-10-24 08:25:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:25:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 545 transitions. [2024-10-24 08:25:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 545 transitions. [2024-10-24 08:25:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 08:25:24,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:25:24,584 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:25:24,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:25:24,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:25:24,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:25:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1692744837, now seen corresponding path program 1 times [2024-10-24 08:25:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:25:24,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802476154] [2024-10-24 08:25:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:25:24,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:25:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:25:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:25:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:25:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:25:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:25:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:25:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:25:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:25:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:25:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:25:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:25:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:25:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:25:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:25:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:25:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:25:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:25:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:25:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:25:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:25:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:25:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:25:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:25:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:25:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:25:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:25:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802476154] [2024-10-24 08:25:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802476154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:25:24,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:25:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:25:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420987780] [2024-10-24 08:25:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:25:25,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:25:25,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:25:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:25:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:25:25,001 INFO L87 Difference]: Start difference. First operand 342 states and 545 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:25:25,107 INFO L93 Difference]: Finished difference Result 510 states and 819 transitions. [2024-10-24 08:25:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:25:25,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-24 08:25:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:25:25,113 INFO L225 Difference]: With dead ends: 510 [2024-10-24 08:25:25,113 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 08:25:25,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-24 08:25:25,116 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 59 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:25:25,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 211 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:25:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 08:25:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2024-10-24 08:25:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-24 08:25:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2024-10-24 08:25:25,157 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 158 [2024-10-24 08:25:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:25:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2024-10-24 08:25:25,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2024-10-24 08:25:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 08:25:25,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:25:25,163 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:25:25,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:25:25,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:25:25,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:25:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash -247709273, now seen corresponding path program 1 times [2024-10-24 08:25:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:25:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317687880] [2024-10-24 08:25:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:25:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:25:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:25:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:25:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:25:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:25:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:25:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:25:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:25:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:25:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:25:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:25:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:25:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:25:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:25:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:25:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:25:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:25:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:25:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:25:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:25:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:25:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:25:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:25:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:25:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:25:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:25:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:25:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:25:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317687880] [2024-10-24 08:25:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317687880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:25:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:25:52,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 08:25:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750266228] [2024-10-24 08:25:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:25:52,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 08:25:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:25:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 08:25:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:25:52,235 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:25:53,167 INFO L93 Difference]: Finished difference Result 508 states and 793 transitions. [2024-10-24 08:25:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 08:25:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-24 08:25:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:25:53,172 INFO L225 Difference]: With dead ends: 508 [2024-10-24 08:25:53,175 INFO L226 Difference]: Without dead ends: 358 [2024-10-24 08:25:53,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:25:53,177 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 193 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:25:53,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 446 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:25:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-24 08:25:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 268. [2024-10-24 08:25:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.434065934065934) internal successors, (261), 184 states have internal predecessors, (261), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:25:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2024-10-24 08:25:53,207 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 158 [2024-10-24 08:25:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:25:53,208 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2024-10-24 08:25:53,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:25:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2024-10-24 08:25:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 08:25:53,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:25:53,213 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:25:53,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:25:53,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:25:53,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:25:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -247649691, now seen corresponding path program 1 times [2024-10-24 08:25:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:25:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559241182] [2024-10-24 08:25:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:25:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:25:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:26:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:26:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:26:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:26:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:26:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:26:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:26:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:26:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:26:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:26:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:26:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:26:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:26:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:26:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:26:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:26:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:26:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:26:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:26:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:26:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:26:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:26:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:26:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:26:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:26:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 08:26:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:26:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559241182] [2024-10-24 08:26:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559241182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:26:20,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:26:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 08:26:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654273791] [2024-10-24 08:26:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:26:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 08:26:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:26:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 08:26:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:26:20,002 INFO L87 Difference]: Start difference. First operand 268 states and 421 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:26:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:26:20,748 INFO L93 Difference]: Finished difference Result 347 states and 525 transitions. [2024-10-24 08:26:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 08:26:20,749 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-24 08:26:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:26:20,751 INFO L225 Difference]: With dead ends: 347 [2024-10-24 08:26:20,753 INFO L226 Difference]: Without dead ends: 345 [2024-10-24 08:26:20,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:26:20,754 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 171 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:26:20,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 556 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:26:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-24 08:26:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 268. [2024-10-24 08:26:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.434065934065934) internal successors, (261), 184 states have internal predecessors, (261), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:26:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2024-10-24 08:26:20,781 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 158 [2024-10-24 08:26:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:26:20,782 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2024-10-24 08:26:20,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 08:26:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2024-10-24 08:26:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 08:26:20,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:26:20,784 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:26:20,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:26:20,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:26:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:26:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1057055899, now seen corresponding path program 1 times [2024-10-24 08:26:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:26:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722539744] [2024-10-24 08:26:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:26:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:26:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat