./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.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 e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:14:37,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:14:37,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:14:37,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:14:37,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:14:37,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:14:37,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:14:37,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:14:37,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:14:37,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:14:37,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:14:37,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:14:37,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:14:37,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:14:37,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:14:37,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:14:37,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:14:37,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:14:37,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:14:37,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:14:37,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:14:37,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:14:37,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:14:37,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:14:37,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:14:37,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:14:37,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:14:37,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:14:37,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:14:37,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:14:37,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:14:37,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:14:37,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:14:37,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:14:37,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:14:37,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:14:37,576 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 -> e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b [2024-11-10 08:14:37,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:14:37,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:14:37,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:14:37,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:14:37,806 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:14:37,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-10 08:14:39,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:14:39,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:14:39,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-10 08:14:39,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183dc65ea/3ef2bc7a1d7a40fd8be318a98592763e/FLAGd52ada491 [2024-11-10 08:14:39,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183dc65ea/3ef2bc7a1d7a40fd8be318a98592763e [2024-11-10 08:14:39,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:14:39,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:14:39,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:14:39,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:14:39,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:14:39,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:14:39" (1/1) ... [2024-11-10 08:14:39,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395aba1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:39, skipping insertion in model container [2024-11-10 08:14:39,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:14:39" (1/1) ... [2024-11-10 08:14:39,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:14:39,838 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_amount100_file-92.i[916,929] [2024-11-10 08:14:39,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:14:39,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:14:39,946 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_amount100_file-92.i[916,929] [2024-11-10 08:14:39,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:14:40,004 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:14:40,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40 WrapperNode [2024-11-10 08:14:40,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:14:40,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:14:40,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:14:40,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:14:40,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,056 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 309 [2024-11-10 08:14:40,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:14:40,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:14:40,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:14:40,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:14:40,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:14:40,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:14:40,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:14:40,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:14:40,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:14:40,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (1/1) ... [2024-11-10 08:14:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:14:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:14:40,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:14:40,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:14:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:14:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:14:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:14:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:14:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:14:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:14:40,311 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:14:40,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:14:40,742 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~ite27#1;havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1;havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~short33#1; [2024-11-10 08:14:40,781 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-10 08:14:40,782 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:14:40,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:14:40,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:14:40,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:14:40 BoogieIcfgContainer [2024-11-10 08:14:40,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:14:40,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:14:40,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:14:40,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:14:40,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:14:39" (1/3) ... [2024-11-10 08:14:40,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e4a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:14:40, skipping insertion in model container [2024-11-10 08:14:40,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:14:40" (2/3) ... [2024-11-10 08:14:40,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e4a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:14:40, skipping insertion in model container [2024-11-10 08:14:40,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:14:40" (3/3) ... [2024-11-10 08:14:40,854 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-92.i [2024-11-10 08:14:40,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:14:40,867 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:14:40,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:14:40,941 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;@5438b673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:14:40,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:14:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:14:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 08:14:40,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:14:40,956 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:14:40,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:14:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:14:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 92768823, now seen corresponding path program 1 times [2024-11-10 08:14:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:14:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787901165] [2024-11-10 08:14:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:14:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:14:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:14:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:14:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:14:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:14:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:14:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:14:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:14:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:14:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:14:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 08:14:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:14:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 08:14:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:14:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 08:14:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:14:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 08:14:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:14:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:14:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 08:14:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 08:14:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:14:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:14:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 08:14:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:14:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787901165] [2024-11-10 08:14:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787901165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:14:41,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:14:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:14:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991764109] [2024-11-10 08:14:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:14:41,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:14:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:14:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:14:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:14:41,317 INFO L87 Difference]: Start difference. First operand has 130 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 08:14:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:14:41,368 INFO L93 Difference]: Finished difference Result 252 states and 415 transitions. [2024-11-10 08:14:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:14:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 161 [2024-11-10 08:14:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:14:41,378 INFO L225 Difference]: With dead ends: 252 [2024-11-10 08:14:41,379 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 08:14:41,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:14:41,385 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:14:41,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:14:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 08:14:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-10 08:14:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 101 states have internal predecessors, (148), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:14:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2024-11-10 08:14:41,424 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 161 [2024-11-10 08:14:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:14:41,424 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2024-11-10 08:14:41,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 08:14:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2024-11-10 08:14:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 08:14:41,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:14:41,427 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:14:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:14:41,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:14:41,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:14:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 256683253, now seen corresponding path program 1 times [2024-11-10 08:14:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:14:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456263939] [2024-11-10 08:14:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:14:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:14:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:14:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:14:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:14:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:14:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:14:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:14:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:14:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:14:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:14:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 08:14:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:14:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 08:14:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:14:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 08:14:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:14:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 08:14:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:14:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:14:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 08:14:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 08:14:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:14:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:14:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 08:14:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:14:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456263939] [2024-11-10 08:14:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456263939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:14:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:14:41,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:14:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27641808] [2024-11-10 08:14:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:14:41,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:14:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:14:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:14:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:14:41,945 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:14:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:14:42,069 INFO L93 Difference]: Finished difference Result 369 states and 570 transitions. [2024-11-10 08:14:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:14:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-10 08:14:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:14:42,076 INFO L225 Difference]: With dead ends: 369 [2024-11-10 08:14:42,076 INFO L226 Difference]: Without dead ends: 247 [2024-11-10 08:14:42,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-10 08:14:42,077 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 135 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:14:42,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 393 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:14:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-10 08:14:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2024-11-10 08:14:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.467005076142132) internal successors, (289), 197 states have internal predecessors, (289), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 08:14:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 377 transitions. [2024-11-10 08:14:42,118 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 377 transitions. Word has length 161 [2024-11-10 08:14:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:14:42,119 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 377 transitions. [2024-11-10 08:14:42,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:14:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 377 transitions. [2024-11-10 08:14:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 08:14:42,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:14:42,127 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:14:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:14:42,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:14:42,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:14:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1762664083, now seen corresponding path program 1 times [2024-11-10 08:14:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:14:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235345229] [2024-11-10 08:14:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:14:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:14:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:14:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:14:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:14:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:14:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:14:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:14:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:14:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:14:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:14:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 08:14:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:14:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 08:14:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:14:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 08:14:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:14:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 08:14:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:14:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:14:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 08:14:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 08:14:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:14:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:14:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 08:14:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:14:42,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235345229] [2024-11-10 08:14:42,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235345229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:14:42,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:14:42,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:14:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654966446] [2024-11-10 08:14:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:14:42,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:14:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:14:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:14:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:14:42,803 INFO L87 Difference]: Start difference. First operand 244 states and 377 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:14:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:14:43,604 INFO L93 Difference]: Finished difference Result 1029 states and 1566 transitions. [2024-11-10 08:14:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:14:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-10 08:14:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:14:43,609 INFO L225 Difference]: With dead ends: 1029 [2024-11-10 08:14:43,609 INFO L226 Difference]: Without dead ends: 907 [2024-11-10 08:14:43,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:14:43,611 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1196 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 08:14:43,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 866 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 08:14:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-10 08:14:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 719. [2024-11-10 08:14:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 582 states have (on average 1.470790378006873) internal successors, (856), 583 states have internal predecessors, (856), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-10 08:14:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1116 transitions. [2024-11-10 08:14:43,688 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1116 transitions. Word has length 162 [2024-11-10 08:14:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:14:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1116 transitions. [2024-11-10 08:14:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:14:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1116 transitions. [2024-11-10 08:14:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 08:14:43,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:14:43,690 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:14:43,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:14:43,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:14:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:14:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1832459486, now seen corresponding path program 1 times [2024-11-10 08:14:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:14:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720240204] [2024-11-10 08:14:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:14:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:14:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:15:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:15:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:15:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:15:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:15:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:15:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:15:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:15:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:15:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 08:15:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:15:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 08:15:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:15:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 08:15:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:15:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 08:15:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:15:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:15:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 08:15:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 08:15:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:15:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:15:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:15:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 08:15:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:15:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720240204] [2024-11-10 08:15:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720240204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:15:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:15:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:15:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966139213] [2024-11-10 08:15:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:15:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:15:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:15:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:15:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:15:04,020 INFO L87 Difference]: Start difference. First operand 719 states and 1116 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:15:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:15:07,567 INFO L93 Difference]: Finished difference Result 2595 states and 3968 transitions. [2024-11-10 08:15:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:15:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-10 08:15:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:15:07,576 INFO L225 Difference]: With dead ends: 2595 [2024-11-10 08:15:07,577 INFO L226 Difference]: Without dead ends: 1879 [2024-11-10 08:15:07,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:15:07,580 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 622 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:15:07,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 614 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 08:15:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2024-11-10 08:15:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 917. [2024-11-10 08:15:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 780 states have (on average 1.5025641025641026) internal successors, (1172), 781 states have internal predecessors, (1172), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-10 08:15:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1432 transitions. [2024-11-10 08:15:07,643 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1432 transitions. Word has length 162 [2024-11-10 08:15:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:15:07,644 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1432 transitions. [2024-11-10 08:15:07,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 08:15:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1432 transitions. [2024-11-10 08:15:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 08:15:07,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:15:07,646 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:15:07,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:15:07,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:15:07,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:15:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1217743329, now seen corresponding path program 1 times [2024-11-10 08:15:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:15:07,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583927042] [2024-11-10 08:15:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:15:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:15:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:13,137 WARN L286 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 225 DAG size of output: 157 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)