./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:50:12,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:50:12,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:50:12,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:50:12,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:50:12,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:50:12,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:50:12,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:50:12,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:50:12,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:50:12,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:50:12,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:50:12,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:50:12,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:50:12,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:50:12,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:50:12,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:50:12,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:50:12,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:50:12,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:50:12,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:50:12,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:50:12,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:50:12,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:50:12,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:50:12,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:50:12,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:50:12,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:50:12,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:50:12,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:50:12,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:50:12,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:50:12,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:50:12,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:50:12,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:50:12,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:50:12,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:50:12,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:50:12,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:50:12,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:50:12,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:50:12,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:50:12,393 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2024-11-10 03:50:12,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:50:12,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:50:12,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:50:12,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:50:12,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:50:12,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-10 03:50:14,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:50:14,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:50:14,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-10 03:50:14,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7e9bbe2/59814fb60f2440139af9bddd2b342322/FLAG7b8e8f59f [2024-11-10 03:50:14,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7e9bbe2/59814fb60f2440139af9bddd2b342322 [2024-11-10 03:50:14,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:50:14,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:50:14,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:50:14,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:50:14,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:50:14,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:50:14" (1/1) ... [2024-11-10 03:50:14,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20405406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:14, skipping insertion in model container [2024-11-10 03:50:14,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:50:14" (1/1) ... [2024-11-10 03:50:14,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:50:14,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i[913,926] [2024-11-10 03:50:14,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:50:14,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:50:15,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-98.i[913,926] [2024-11-10 03:50:15,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:50:15,076 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:50:15,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15 WrapperNode [2024-11-10 03:50:15,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:50:15,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:50:15,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:50:15,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:50:15,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,131 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-10 03:50:15,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:50:15,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:50:15,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:50:15,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:50:15,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,175 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:50:15,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:50:15,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:50:15,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:50:15,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:50:15,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (1/1) ... [2024-11-10 03:50:15,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:50:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:50:15,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:50:15,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:50:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:50:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:50:15,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:50:15,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:50:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:50:15,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:50:15,376 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:50:15,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:50:15,689 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~bitwise17#1; [2024-11-10 03:50:15,736 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:50:15,736 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:50:15,767 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:50:15,767 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:50:15,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:50:15 BoogieIcfgContainer [2024-11-10 03:50:15,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:50:15,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:50:15,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:50:15,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:50:15,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:50:14" (1/3) ... [2024-11-10 03:50:15,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d4bc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:50:15, skipping insertion in model container [2024-11-10 03:50:15,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:50:15" (2/3) ... [2024-11-10 03:50:15,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d4bc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:50:15, skipping insertion in model container [2024-11-10 03:50:15,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:50:15" (3/3) ... [2024-11-10 03:50:15,777 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-98.i [2024-11-10 03:50:15,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:50:15,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:50:15,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:50:15,857 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;@9b462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:50:15,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:50:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 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-11-10 03:50:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:50:15,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:50:15,878 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] [2024-11-10 03:50:15,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:50:15,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:50:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 778448215, now seen corresponding path program 1 times [2024-11-10 03:50:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:50:15,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511560851] [2024-11-10 03:50:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:50:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:50:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:50:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:50:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:50:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:50:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:50:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:50:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:50:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:50:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:50:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:50:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:50:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:50:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:50:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:50:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:50:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:50:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:50:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:50:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:50:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:50:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:50:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:50:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:50:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:50:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:50:16,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:50:16,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511560851] [2024-11-10 03:50:16,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511560851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:50:16,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:50:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:50:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190808683] [2024-11-10 03:50:16,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:50:16,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:50:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:50:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:50:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:50:16,413 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-11-10 03:50:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:50:16,484 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2024-11-10 03:50:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:50:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 155 [2024-11-10 03:50:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:50:16,500 INFO L225 Difference]: With dead ends: 146 [2024-11-10 03:50:16,500 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 03:50:16,503 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-11-10 03:50:16,506 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:50:16,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:50:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 03:50:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 03:50:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 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-11-10 03:50:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-10 03:50:16,587 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 155 [2024-11-10 03:50:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:50:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-10 03:50:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-11-10 03:50:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-10 03:50:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:50:16,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:50:16,594 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] [2024-11-10 03:50:16,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:50:16,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:50:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:50:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash -74423205, now seen corresponding path program 1 times [2024-11-10 03:50:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:50:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166608617] [2024-11-10 03:50:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:50:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:50:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:50:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:50:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:50:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:50:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:50:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:50:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:50:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:50:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:50:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:50:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:50:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:50:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:50:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:50:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:50:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:50:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:50:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:50:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:50:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:50:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:50:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:50:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:50:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:50:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:50:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:50:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166608617] [2024-11-10 03:50:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166608617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:50:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:50:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:50:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772687788] [2024-11-10 03:50:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:50:17,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:50:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:50:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:50:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:50:17,497 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11-10 03:50:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:50:17,660 INFO L93 Difference]: Finished difference Result 211 states and 320 transitions. [2024-11-10 03:50:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:50:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 155 [2024-11-10 03:50:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:50:17,664 INFO L225 Difference]: With dead ends: 211 [2024-11-10 03:50:17,664 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 03:50:17,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:50:17,667 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 69 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:50:17,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 389 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:50:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 03:50:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-10 03:50:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 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-11-10 03:50:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2024-11-10 03:50:17,715 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 155 [2024-11-10 03:50:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:50:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2024-11-10 03:50:17,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11-10 03:50:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2024-11-10 03:50:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:50:17,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:50:17,722 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] [2024-11-10 03:50:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:50:17,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:50:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:50:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2117062202, now seen corresponding path program 1 times [2024-11-10 03:50:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:50:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759138674] [2024-11-10 03:50:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:50:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:50:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:50:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:50:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:50:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:50:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:50:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:50:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:50:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:50:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:50:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:50:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:50:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:50:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:50:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:50:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:50:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:50:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:50:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:50:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:50:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:50:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:50:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:50:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:50:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:50:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:50:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:50:18,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759138674] [2024-11-10 03:50:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759138674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:50:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:50:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:50:18,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931645300] [2024-11-10 03:50:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:50:18,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:50:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:50:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:50:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:50:18,535 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-11-10 03:50:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:50:18,795 INFO L93 Difference]: Finished difference Result 285 states and 434 transitions. [2024-11-10 03:50:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:50:18,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 155 [2024-11-10 03:50:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:50:18,800 INFO L225 Difference]: With dead ends: 285 [2024-11-10 03:50:18,801 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 03:50:18,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:50:18,805 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 82 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:50:18,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 235 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:50:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 03:50:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2024-11-10 03:50:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 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-11-10 03:50:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2024-11-10 03:50:18,838 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 155 [2024-11-10 03:50:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:50:18,839 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2024-11-10 03:50:18,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-11-10 03:50:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2024-11-10 03:50:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:50:18,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:50:18,842 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] [2024-11-10 03:50:18,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:50:18,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:50:18,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:50:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1823659195, now seen corresponding path program 1 times [2024-11-10 03:50:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:50:18,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315443079] [2024-11-10 03:50:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:50:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:50:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:50:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:50:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:50:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:50:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:50:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:50:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:50:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:50:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:50:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:50:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:50:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:50:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:50:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:50:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:50:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:50:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:50:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:50:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:50:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:50:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:50:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:50:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:50:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:50:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:50:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:50:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:50:20,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315443079] [2024-11-10 03:50:20,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315443079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:50:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:50:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:50:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680360595] [2024-11-10 03:50:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:50:20,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:50:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:50:20,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:50:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:50:20,277 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-10 03:50:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:50:21,175 INFO L93 Difference]: Finished difference Result 443 states and 667 transitions. [2024-11-10 03:50:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:50:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 155 [2024-11-10 03:50:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:50:21,180 INFO L225 Difference]: With dead ends: 443 [2024-11-10 03:50:21,180 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 03:50:21,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:50:21,182 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 309 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:50:21,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 418 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:50:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 03:50:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 249. [2024-11-10 03:50:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 153 states have internal predecessors, (194), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 03:50:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 378 transitions. [2024-11-10 03:50:21,250 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 378 transitions. Word has length 155 [2024-11-10 03:50:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:50:21,251 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 378 transitions. [2024-11-10 03:50:21,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-10 03:50:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 378 transitions. [2024-11-10 03:50:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:50:21,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:50:21,256 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] [2024-11-10 03:50:21,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:50:21,256 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:50:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:50:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -728497766, now seen corresponding path program 1 times [2024-11-10 03:50:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:50:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373252030] [2024-11-10 03:50:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:50:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:50:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat