./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.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 98abf4a1b601d6abbbc90dbefd7ca63cb5df651c9c8cacf5dc6a77e5a21d9e4c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:55:08,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:55:08,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:55:08,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:55:08,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:55:08,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:55:08,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:55:08,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:55:08,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:55:08,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:55:08,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:55:08,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:55:08,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:55:08,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:55:08,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:55:08,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:55:08,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:55:08,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:55:08,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:55:08,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:55:08,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:55:08,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:55:08,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:55:08,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:55:08,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:55:08,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:55:08,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:55:08,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:55:08,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:55:08,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:55:08,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:55:08,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:55:08,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:55:08,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:55:08,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:55:08,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:55:08,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:55:08,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:55:08,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:55:08,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:55:08,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:55:08,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:55:08,471 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 -> 98abf4a1b601d6abbbc90dbefd7ca63cb5df651c9c8cacf5dc6a77e5a21d9e4c [2024-11-10 04:55:08,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:55:08,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:55:08,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:55:08,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:55:08,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:55:08,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.i [2024-11-10 04:55:10,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:55:10,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:55:10,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.i [2024-11-10 04:55:10,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac959f8f/fcd12986827c4d31a5fff5b60bea983e/FLAGf42c4e90f [2024-11-10 04:55:10,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac959f8f/fcd12986827c4d31a5fff5b60bea983e [2024-11-10 04:55:10,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:55:10,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:55:10,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:55:10,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:55:10,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:55:10,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f3425e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10, skipping insertion in model container [2024-11-10 04:55:10,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:55:10,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.i[919,932] [2024-11-10 04:55:10,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:55:10,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:55:10,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.i[919,932] [2024-11-10 04:55:10,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:55:10,798 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:55:10,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10 WrapperNode [2024-11-10 04:55:10,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:55:10,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:55:10,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:55:10,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:55:10,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,897 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2024-11-10 04:55:10,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:55:10,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:55:10,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:55:10,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:55:10,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,944 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 04:55:10,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:55:10,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:55:10,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:55:10,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:55:10,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (1/1) ... [2024-11-10 04:55:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:55:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:55:11,047 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 04:55:11,051 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 04:55:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:55:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:55:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:55:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:55:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:55:11,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:55:11,179 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:55:11,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:55:11,470 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise22#1; [2024-11-10 04:55:11,533 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:55:11,533 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:55:11,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:55:11,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:55:11,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:55:11 BoogieIcfgContainer [2024-11-10 04:55:11,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:55:11,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:55:11,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:55:11,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:55:11,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:55:10" (1/3) ... [2024-11-10 04:55:11,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71066f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:55:11, skipping insertion in model container [2024-11-10 04:55:11,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:55:10" (2/3) ... [2024-11-10 04:55:11,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71066f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:55:11, skipping insertion in model container [2024-11-10 04:55:11,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:55:11" (3/3) ... [2024-11-10 04:55:11,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-44.i [2024-11-10 04:55:11,600 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:55:11,601 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:55:11,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:55:11,658 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;@435f78e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:55:11,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:55:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:55:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 04:55:11,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:11,680 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:11,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:11,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2083468384, now seen corresponding path program 1 times [2024-11-10 04:55:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:55:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812838651] [2024-11-10 04:55:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:55:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:55:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:55:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:55:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:55:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:55:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:55:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:55:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:55:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:55:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:55:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:55:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:55:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:55:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:55:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:55:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:55:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:55:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:55:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:55:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:55:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:55:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:55:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:55:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:55:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:55:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:55:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:55:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:55:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:55:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:55:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:55:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:55:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:55:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812838651] [2024-11-10 04:55:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812838651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:12,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:12,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:55:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884608519] [2024-11-10 04:55:12,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:12,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:55:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:55:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:55:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:55:12,532 INFO L87 Difference]: Start difference. First operand has 101 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 04:55:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:12,591 INFO L93 Difference]: Finished difference Result 194 states and 340 transitions. [2024-11-10 04:55:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:55:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2024-11-10 04:55:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:12,639 INFO L225 Difference]: With dead ends: 194 [2024-11-10 04:55:12,643 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 04:55:12,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 04:55:12,659 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:12,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:55:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 04:55:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 04:55:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:55:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2024-11-10 04:55:12,771 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 202 [2024-11-10 04:55:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:12,772 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2024-11-10 04:55:12,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 04:55:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2024-11-10 04:55:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 04:55:12,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:12,778 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:12,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:55:12,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:12,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1426325697, now seen corresponding path program 1 times [2024-11-10 04:55:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:55:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533079747] [2024-11-10 04:55:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:55:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:55:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:55:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:55:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:55:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 04:55:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:55:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:55:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:55:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:55:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:55:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:55:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 04:55:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:55:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:55:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:55:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:55:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:55:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:55:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:55:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:55:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 04:55:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:55:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:55:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:55:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:55:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:55:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 04:55:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:55:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 04:55:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 04:55:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 04:55:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:55:13,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:55:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533079747] [2024-11-10 04:55:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533079747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:13,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:55:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468167367] [2024-11-10 04:55:13,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:55:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:55:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:55:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:13,066 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:55:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:13,147 INFO L93 Difference]: Finished difference Result 193 states and 300 transitions. [2024-11-10 04:55:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:55:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 04:55:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:13,153 INFO L225 Difference]: With dead ends: 193 [2024-11-10 04:55:13,154 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 04:55:13,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 04:55:13,156 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 89 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:13,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 179 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:55:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 04:55:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 04:55:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:55:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 152 transitions. [2024-11-10 04:55:13,179 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 152 transitions. Word has length 202 [2024-11-10 04:55:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 152 transitions. [2024-11-10 04:55:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:55:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 152 transitions. [2024-11-10 04:55:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 04:55:13,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:13,182 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:13,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:55:13,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:13,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash -370625662, now seen corresponding path program 1 times [2024-11-10 04:55:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:55:13,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458946518] [2024-11-10 04:55:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:55:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:55:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944340489] [2024-11-10 04:55:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:55:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:55:13,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:55:13,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:55:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:13,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 04:55:13,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1163 proven. 156 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2024-11-10 04:55:17,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:55:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 04:55:24,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:55:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458946518] [2024-11-10 04:55:24,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:55:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944340489] [2024-11-10 04:55:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944340489] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 04:55:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:55:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2024-11-10 04:55:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167904178] [2024-11-10 04:55:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 04:55:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:55:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 04:55:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-11-10 04:55:24,013 INFO L87 Difference]: Start difference. First operand 100 states and 152 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:55:32,355 WARN L286 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 04:55:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:46,171 INFO L93 Difference]: Finished difference Result 571 states and 824 transitions. [2024-11-10 04:55:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 04:55:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 04:55:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:46,181 INFO L225 Difference]: With dead ends: 571 [2024-11-10 04:55:46,181 INFO L226 Difference]: Without dead ends: 474 [2024-11-10 04:55:46,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=252, Invalid=870, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 04:55:46,182 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1187 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:46,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 609 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-10 04:55:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-10 04:55:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 201. [2024-11-10 04:55:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 159 states have internal predecessors, (232), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 04:55:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 310 transitions. [2024-11-10 04:55:46,227 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 310 transitions. Word has length 202 [2024-11-10 04:55:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 310 transitions. [2024-11-10 04:55:46,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 04:55:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 310 transitions. [2024-11-10 04:55:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 04:55:46,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:46,231 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:46,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:55:46,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:55:46,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -664028669, now seen corresponding path program 1 times [2024-11-10 04:55:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:55:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751985593] [2024-11-10 04:55:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:55:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:55:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210305516] [2024-11-10 04:55:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:46,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:55:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:55:46,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:55:46,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:55:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:46,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 04:55:46,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1204 proven. 195 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-11-10 04:55:49,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:56:05,024 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 04:56:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 84 proven. 93 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-10 04:56:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:56:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751985593] [2024-11-10 04:56:27,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:56:27,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210305516] [2024-11-10 04:56:27,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210305516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:56:27,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:56:27,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 34 [2024-11-10 04:56:27,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005234653] [2024-11-10 04:56:27,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:56:27,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 04:56:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:56:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 04:56:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 04:56:27,421 INFO L87 Difference]: Start difference. First operand 201 states and 310 transitions. Second operand has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 33 states have internal predecessors, (110), 8 states have call successors, (58), 6 states have call predecessors, (58), 11 states have return successors, (58), 8 states have call predecessors, (58), 8 states have call successors, (58)