./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.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_operatoramount_amount50_file-10.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 d7b31703d13ddb01e2d77e44fcd8433b76663feaf751198b77497c752932cfd2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:46:37,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:46:37,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:46:37,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:46:37,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:46:37,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:46:37,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:46:37,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:46:37,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:46:37,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:46:37,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:46:37,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:46:37,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:46:37,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:46:37,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:46:37,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:46:37,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:46:37,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:46:37,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:46:37,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:46:37,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:46:37,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:46:37,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:46:37,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:46:37,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:46:37,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:46:37,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:46:37,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:46:37,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:46:37,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:46:37,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:46:37,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:46:37,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:46:37,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:46:37,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:46:37,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:46:37,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:46:37,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:46:37,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:46:37,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:46:37,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:46:37,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:46:37,131 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 -> d7b31703d13ddb01e2d77e44fcd8433b76663feaf751198b77497c752932cfd2 [2024-11-16 17:46:37,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:46:37,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:46:37,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:46:37,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:46:37,396 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:46:37,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.i [2024-11-16 17:46:38,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:46:39,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:46:39,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.i [2024-11-16 17:46:39,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6874ecd8/12cd336172ae47cc81b90a3e8ae90ce2/FLAG289935311 [2024-11-16 17:46:39,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6874ecd8/12cd336172ae47cc81b90a3e8ae90ce2 [2024-11-16 17:46:39,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:46:39,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:46:39,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:46:39,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:46:39,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:46:39,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abad8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39, skipping insertion in model container [2024-11-16 17:46:39,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:46:39,679 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.i[915,928] [2024-11-16 17:46:39,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:46:39,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:46:39,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.i[915,928] [2024-11-16 17:46:39,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:46:39,863 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:46:39,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39 WrapperNode [2024-11-16 17:46:39,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:46:39,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:46:39,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:46:39,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:46:39,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,942 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-16 17:46:39,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:46:39,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:46:39,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:46:39,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:46:39,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:39,999 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 17:46:40,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:46:40,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:46:40,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:46:40,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:46:40,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (1/1) ... [2024-11-16 17:46:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:46:40,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:46:40,079 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 17:46:40,089 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 17:46:40,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:46:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:46:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:46:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:46:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:46:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:46:40,235 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:46:40,239 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:46:40,633 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2024-11-16 17:46:40,689 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-16 17:46:40,690 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:46:40,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:46:40,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:46:40,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:46:40 BoogieIcfgContainer [2024-11-16 17:46:40,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:46:40,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:46:40,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:46:40,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:46:40,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:46:39" (1/3) ... [2024-11-16 17:46:40,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d158e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:46:40, skipping insertion in model container [2024-11-16 17:46:40,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:46:39" (2/3) ... [2024-11-16 17:46:40,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d158e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:46:40, skipping insertion in model container [2024-11-16 17:46:40,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:46:40" (3/3) ... [2024-11-16 17:46:40,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-10.i [2024-11-16 17:46:40,743 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:46:40,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:46:40,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:46:40,832 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;@4ff6a434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:46:40,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:46:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 17:46:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 17:46:40,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:46:40,854 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:40,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:46:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:46:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash 661365092, now seen corresponding path program 1 times [2024-11-16 17:46:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:46:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315068840] [2024-11-16 17:46:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:46:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:46:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:46:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:46:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:46:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:46:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:46:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:46:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:46:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:46:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:46:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:46:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:46:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:46:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:46:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:46:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:46:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:46:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:46:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:46:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:46:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:46:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315068840] [2024-11-16 17:46:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315068840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:46:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:46:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:46:41,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283167324] [2024-11-16 17:46:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:46:41,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:46:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:46:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:46:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:46:41,361 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:46:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:46:41,396 INFO L93 Difference]: Finished difference Result 146 states and 237 transitions. [2024-11-16 17:46:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:46:41,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-16 17:46:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:46:41,410 INFO L225 Difference]: With dead ends: 146 [2024-11-16 17:46:41,410 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 17:46:41,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 17:46:41,420 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:46:41,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:46:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 17:46:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-16 17:46:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 17:46:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2024-11-16 17:46:41,482 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 124 [2024-11-16 17:46:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:46:41,484 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2024-11-16 17:46:41,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:46:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2024-11-16 17:46:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 17:46:41,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:46:41,490 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:41,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:46:41,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:46:41,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:46:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1998007804, now seen corresponding path program 1 times [2024-11-16 17:46:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:46:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614878975] [2024-11-16 17:46:41,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:46:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:46:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:46:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:46:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:46:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:46:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:46:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:46:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:46:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:46:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:46:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:46:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:46:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:46:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:46:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:46:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:46:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:46:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:46:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:46:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:46:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:46:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:46:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614878975] [2024-11-16 17:46:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614878975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:46:42,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:46:42,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:46:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729413397] [2024-11-16 17:46:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:46:42,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:46:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:46:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:46:42,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:46:42,295 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:46:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:46:42,525 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-11-16 17:46:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:46:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-16 17:46:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:46:42,531 INFO L225 Difference]: With dead ends: 212 [2024-11-16 17:46:42,531 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 17:46:42,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-16 17:46:42,533 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 74 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:46:42,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 280 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:46:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 17:46:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2024-11-16 17:46:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 17:46:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2024-11-16 17:46:42,562 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 124 [2024-11-16 17:46:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:46:42,563 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2024-11-16 17:46:42,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:46:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2024-11-16 17:46:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 17:46:42,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:46:42,566 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:42,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:46:42,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:46:42,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:46:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash -307283695, now seen corresponding path program 1 times [2024-11-16 17:46:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:46:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472530948] [2024-11-16 17:46:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:46:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:46:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:47:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:47:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:47:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:47:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:47:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:47:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:47:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:47:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:47:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:47:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:47:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:47:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:47:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:47:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:47:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:47:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:47:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:47:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:47:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:47:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472530948] [2024-11-16 17:47:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472530948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:47:01,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:47:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 17:47:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768266] [2024-11-16 17:47:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:47:01,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 17:47:01,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:47:01,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 17:47:01,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 17:47:01,720 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:47:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:47:03,816 INFO L93 Difference]: Finished difference Result 401 states and 567 transitions. [2024-11-16 17:47:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 17:47:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-16 17:47:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:47:03,823 INFO L225 Difference]: With dead ends: 401 [2024-11-16 17:47:03,823 INFO L226 Difference]: Without dead ends: 332 [2024-11-16 17:47:03,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2024-11-16 17:47:03,825 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 627 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:47:03,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 669 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 17:47:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-16 17:47:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 195. [2024-11-16 17:47:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 136 states have (on average 1.286764705882353) internal successors, (175), 137 states have internal predecessors, (175), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 17:47:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-16 17:47:03,852 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 125 [2024-11-16 17:47:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:47:03,853 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-16 17:47:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:47:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-16 17:47:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 17:47:03,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:47:03,856 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:47:03,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:47:03,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:47:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:47:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1797705232, now seen corresponding path program 1 times [2024-11-16 17:47:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:47:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940153350] [2024-11-16 17:47:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:47:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:47:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:47:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:47:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:47:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:47:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:47:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:47:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:47:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:47:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:47:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:47:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:47:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:47:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:47:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:47:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:47:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:47:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:47:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:47:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:47:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:47:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:47:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940153350] [2024-11-16 17:47:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940153350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:47:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:47:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 17:47:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378407513] [2024-11-16 17:47:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:47:17,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 17:47:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:47:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 17:47:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-16 17:47:17,747 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:47:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:47:19,435 INFO L93 Difference]: Finished difference Result 497 states and 693 transitions. [2024-11-16 17:47:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 17:47:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-11-16 17:47:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:47:19,439 INFO L225 Difference]: With dead ends: 497 [2024-11-16 17:47:19,439 INFO L226 Difference]: Without dead ends: 428 [2024-11-16 17:47:19,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2024-11-16 17:47:19,442 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 378 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:47:19,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 690 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 17:47:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-16 17:47:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 219. [2024-11-16 17:47:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 159 states have internal predecessors, (208), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 17:47:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-16 17:47:19,481 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 125 [2024-11-16 17:47:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:47:19,482 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-16 17:47:19,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:47:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-16 17:47:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 17:47:19,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:47:19,484 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:47:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:47:19,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:47:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:47:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1601191727, now seen corresponding path program 1 times [2024-11-16 17:47:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:47:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575797831] [2024-11-16 17:47:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:47:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:47:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat