./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_codestructure_dependencies_file-31.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 e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:02:46,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:02:46,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:02:46,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:02:46,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:02:46,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:02:46,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:02:46,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:02:46,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:02:46,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:02:46,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:02:46,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:02:46,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:02:46,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:02:46,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:02:46,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:02:46,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:02:46,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:02:46,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:02:46,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:02:46,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:02:46,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:02:46,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:02:46,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:02:46,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:02:46,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:02:46,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:02:46,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:02:46,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:02:46,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:02:46,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:02:46,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:02:46,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:02:46,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:02:46,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:02:46,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:02:46,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:02:46,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:02:46,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:02:46,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:02:46,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:02:46,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:02:46,786 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 -> e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1 [2024-11-16 12:02:47,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:02:47,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:02:47,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:02:47,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:02:47,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:02:47,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i [2024-11-16 12:02:48,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:02:48,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:02:48,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i [2024-11-16 12:02:48,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ebd9ef6/451d347c80c84cf68a415d4fcb3b78d0/FLAG62422b214 [2024-11-16 12:02:49,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ebd9ef6/451d347c80c84cf68a415d4fcb3b78d0 [2024-11-16 12:02:49,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:02:49,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:02:49,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:02:49,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:02:49,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:02:49,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eb3d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49, skipping insertion in model container [2024-11-16 12:02:49,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:02:49,387 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_codestructure_dependencies_file-31.i[919,932] [2024-11-16 12:02:49,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:02:49,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:02:49,509 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_codestructure_dependencies_file-31.i[919,932] [2024-11-16 12:02:49,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:02:49,559 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:02:49,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49 WrapperNode [2024-11-16 12:02:49,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:02:49,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:02:49,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:02:49,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:02:49,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,616 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-16 12:02:49,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:02:49,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:02:49,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:02:49,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:02:49,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,654 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-16 12:02:49,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:02:49,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:02:49,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:02:49,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:02:49,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (1/1) ... [2024-11-16 12:02:49,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:02:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:02:49,719 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-16 12:02:49,726 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-16 12:02:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:02:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:02:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:02:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:02:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:02:49,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:02:49,875 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:02:49,877 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:02:50,199 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:02:50,199 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:02:50,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:02:50,220 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:02:50,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:02:50 BoogieIcfgContainer [2024-11-16 12:02:50,222 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:02:50,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:02:50,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:02:50,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:02:50,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:02:49" (1/3) ... [2024-11-16 12:02:50,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca28f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:50, skipping insertion in model container [2024-11-16 12:02:50,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:49" (2/3) ... [2024-11-16 12:02:50,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca28f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:50, skipping insertion in model container [2024-11-16 12:02:50,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:02:50" (3/3) ... [2024-11-16 12:02:50,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-31.i [2024-11-16 12:02:50,247 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:02:50,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:02:50,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:02:50,314 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;@3b3e19aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:02:50,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:02:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-16 12:02:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 12:02:50,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:02:50,338 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] [2024-11-16 12:02:50,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:02:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:02:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1003218858, now seen corresponding path program 1 times [2024-11-16 12:02:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:02:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036110199] [2024-11-16 12:02:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:02:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:02:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:02:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:02:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:02:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:02:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:02:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:02:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:02:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:02:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:02:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:02:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:02:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:02:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:02:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:02:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:02:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:02:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:02:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:02:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:02:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:02:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:02:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:02:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:02:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:02:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:50,879 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-16 12:02:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:02:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036110199] [2024-11-16 12:02:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036110199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:02:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:02:50,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:02:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996622129] [2024-11-16 12:02:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:02:50,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:02:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:02:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:02:50,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:02:50,912 INFO L87 Difference]: Start difference. First operand has 68 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-16 12:02:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:02:50,942 INFO L93 Difference]: Finished difference Result 128 states and 223 transitions. [2024-11-16 12:02:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:02:50,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 149 [2024-11-16 12:02:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:02:50,953 INFO L225 Difference]: With dead ends: 128 [2024-11-16 12:02:50,955 INFO L226 Difference]: Without dead ends: 63 [2024-11-16 12:02:50,959 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-16 12:02:50,964 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:02:50,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:02:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-16 12:02:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-16 12:02:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 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-16 12:02:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-16 12:02:51,010 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 149 [2024-11-16 12:02:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:02:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-16 12:02:51,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-16 12:02:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-16 12:02:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 12:02:51,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:02:51,016 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] [2024-11-16 12:02:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:02:51,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:02:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:02:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash -341504086, now seen corresponding path program 1 times [2024-11-16 12:02:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:02:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015119737] [2024-11-16 12:02:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:02:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:02:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:02:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:02:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:02:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:02:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:02:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:02:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:02:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:02:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:02:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:02:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:02:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:02:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:02:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:02:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:02:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:02:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:02:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:02:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:02:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:02:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:02:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:02:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:02:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:02:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:02:51,323 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-16 12:02:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:02:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015119737] [2024-11-16 12:02:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015119737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:02:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:02:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:02:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208115010] [2024-11-16 12:02:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:02:51,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:02:51,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:02:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:02:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:02:51,328 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-16 12:02:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:02:51,408 INFO L93 Difference]: Finished difference Result 181 states and 275 transitions. [2024-11-16 12:02:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:02:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 149 [2024-11-16 12:02:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:02:51,415 INFO L225 Difference]: With dead ends: 181 [2024-11-16 12:02:51,415 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 12:02:51,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-11-16 12:02:51,418 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 84 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:02:51,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 256 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:02:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 12:02:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 66. [2024-11-16 12:02:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 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-16 12:02:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2024-11-16 12:02:51,447 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 149 [2024-11-16 12:02:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:02:51,449 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2024-11-16 12:02:51,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-16 12:02:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2024-11-16 12:02:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 12:02:51,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:02:51,454 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] [2024-11-16 12:02:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:02:51,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:02:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:02:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1401306249, now seen corresponding path program 1 times [2024-11-16 12:02:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:02:51,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042546329] [2024-11-16 12:02:51,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:02:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:02:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat