./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash e17c5b3ed60cb499b39cb2b1e8b8a9f98620b54414dc6e7bf682fa48216723e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:12:54,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:12:54,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:12:54,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:12:54,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:12:54,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:12:54,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:12:54,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:12:54,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:12:54,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:12:54,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:12:54,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:12:54,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:12:54,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:12:54,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:12:54,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:12:54,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:12:54,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:12:54,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:12:54,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:12:54,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:12:54,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:12:54,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:12:54,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:12:54,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:12:54,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:12:54,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:12:54,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:12:54,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:12:54,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:12:54,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:12:54,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:12:54,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:12:54,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:12:54,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:12:54,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:12:54,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:12:54,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:12:54,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:12:54,230 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e17c5b3ed60cb499b39cb2b1e8b8a9f98620b54414dc6e7bf682fa48216723e3 [2024-11-10 01:12:54,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:12:54,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:12:54,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:12:54,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:12:54,546 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:12:54,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c [2024-11-10 01:12:56,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:12:56,277 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:12:56,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c [2024-11-10 01:12:56,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1667ab03/e7bc62da3a8d4164b1c359e37d018c7b/FLAG2a996f3da [2024-11-10 01:12:56,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1667ab03/e7bc62da3a8d4164b1c359e37d018c7b [2024-11-10 01:12:56,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:12:56,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:12:56,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:12:56,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:12:56,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:12:56,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498dad95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56, skipping insertion in model container [2024-11-10 01:12:56,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:12:56,576 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/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c[1173,1186] [2024-11-10 01:12:56,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:12:56,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:12:56,777 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/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c[1173,1186] [2024-11-10 01:12:56,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:12:56,854 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:12:56,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56 WrapperNode [2024-11-10 01:12:56,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:12:56,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:12:56,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:12:56,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:12:56,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:56,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,106 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2024-11-10 01:12:57,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:12:57,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:12:57,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:12:57,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:12:57,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,228 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 01:12:57,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:12:57,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:12:57,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:12:57,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:12:57,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (1/1) ... [2024-11-10 01:12:57,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:12:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:12:57,443 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 01:12:57,449 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 01:12:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:12:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:12:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:12:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:12:57,840 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:12:57,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:12:59,862 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2024-11-10 01:12:59,863 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:12:59,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:12:59,982 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-10 01:12:59,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:59 BoogieIcfgContainer [2024-11-10 01:12:59,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:12:59,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:12:59,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:12:59,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:12:59,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:12:56" (1/3) ... [2024-11-10 01:12:59,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caf90fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:12:59, skipping insertion in model container [2024-11-10 01:12:59,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:12:56" (2/3) ... [2024-11-10 01:12:59,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1caf90fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:12:59, skipping insertion in model container [2024-11-10 01:12:59,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:59" (3/3) ... [2024-11-10 01:12:59,996 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.6.prop1-func-interl.c [2024-11-10 01:13:00,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:13:00,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:13:00,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:13:00,121 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;@605b8bd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:13:00,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:13:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 600 states, 598 states have (on average 1.5) internal successors, (897), 599 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 01:13:00,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:00,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:00,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:00,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 269099986, now seen corresponding path program 1 times [2024-11-10 01:13:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748645744] [2024-11-10 01:13:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:00,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748645744] [2024-11-10 01:13:00,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748645744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:00,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179213681] [2024-11-10 01:13:00,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:00,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:00,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:00,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:00,797 INFO L87 Difference]: Start difference. First operand has 600 states, 598 states have (on average 1.5) internal successors, (897), 599 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:01,214 INFO L93 Difference]: Finished difference Result 1153 states and 1728 transitions. [2024-11-10 01:13:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 01:13:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:01,239 INFO L225 Difference]: With dead ends: 1153 [2024-11-10 01:13:01,240 INFO L226 Difference]: Without dead ends: 595 [2024-11-10 01:13:01,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:01,249 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 859 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:01,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1472 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:13:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-10 01:13:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2024-11-10 01:13:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4983164983164983) internal successors, (890), 594 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 890 transitions. [2024-11-10 01:13:01,313 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 890 transitions. Word has length 60 [2024-11-10 01:13:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 890 transitions. [2024-11-10 01:13:01,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 890 transitions. [2024-11-10 01:13:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 01:13:01,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:01,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:01,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:13:01,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:01,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1085121744, now seen corresponding path program 1 times [2024-11-10 01:13:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465039970] [2024-11-10 01:13:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465039970] [2024-11-10 01:13:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465039970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:01,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:13:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452428639] [2024-11-10 01:13:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:01,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:13:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:13:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:13:01,561 INFO L87 Difference]: Start difference. First operand 595 states and 890 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:01,820 INFO L93 Difference]: Finished difference Result 1149 states and 1720 transitions. [2024-11-10 01:13:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:13:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 01:13:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:01,824 INFO L225 Difference]: With dead ends: 1149 [2024-11-10 01:13:01,825 INFO L226 Difference]: Without dead ends: 596 [2024-11-10 01:13:01,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 01:13:01,828 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 0 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:01,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1479 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:13:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-10 01:13:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2024-11-10 01:13:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2024-11-10 01:13:01,859 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 61 [2024-11-10 01:13:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:01,860 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2024-11-10 01:13:01,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2024-11-10 01:13:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 01:13:01,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:01,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:13:01,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:01,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1499853649, now seen corresponding path program 1 times [2024-11-10 01:13:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:01,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257137255] [2024-11-10 01:13:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257137255] [2024-11-10 01:13:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257137255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490869004] [2024-11-10 01:13:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:02,118 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:02,446 INFO L93 Difference]: Finished difference Result 601 states and 896 transitions. [2024-11-10 01:13:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-10 01:13:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:02,450 INFO L225 Difference]: With dead ends: 601 [2024-11-10 01:13:02,450 INFO L226 Difference]: Without dead ends: 598 [2024-11-10 01:13:02,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:02,452 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:02,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2218 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:13:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-10 01:13:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-11-10 01:13:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2024-11-10 01:13:02,491 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 61 [2024-11-10 01:13:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:02,491 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2024-11-10 01:13:02,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2024-11-10 01:13:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 01:13:02,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:02,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:02,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:13:02,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:02,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash 894231340, now seen corresponding path program 1 times [2024-11-10 01:13:02,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:02,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116073321] [2024-11-10 01:13:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116073321] [2024-11-10 01:13:02,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116073321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:02,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:02,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866364395] [2024-11-10 01:13:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:02,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:02,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:02,638 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:02,966 INFO L93 Difference]: Finished difference Result 1156 states and 1727 transitions. [2024-11-10 01:13:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 01:13:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:02,969 INFO L225 Difference]: With dead ends: 1156 [2024-11-10 01:13:02,969 INFO L226 Difference]: Without dead ends: 600 [2024-11-10 01:13:02,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:02,972 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:02,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2215 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:13:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-10 01:13:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-10 01:13:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2024-11-10 01:13:02,991 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 62 [2024-11-10 01:13:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:02,993 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2024-11-10 01:13:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2024-11-10 01:13:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 01:13:02,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:02,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:13:02,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:02,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1698612148, now seen corresponding path program 1 times [2024-11-10 01:13:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147274058] [2024-11-10 01:13:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:03,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:03,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147274058] [2024-11-10 01:13:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147274058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000476092] [2024-11-10 01:13:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:03,186 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:03,506 INFO L93 Difference]: Finished difference Result 1160 states and 1731 transitions. [2024-11-10 01:13:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 01:13:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:03,510 INFO L225 Difference]: With dead ends: 1160 [2024-11-10 01:13:03,510 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:13:03,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:03,514 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 0 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:03,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2210 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:13:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:13:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:13:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2024-11-10 01:13:03,528 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 63 [2024-11-10 01:13:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:03,529 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2024-11-10 01:13:03,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2024-11-10 01:13:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 01:13:03,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:03,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:03,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:13:03,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:03,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash -472934745, now seen corresponding path program 1 times [2024-11-10 01:13:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226695441] [2024-11-10 01:13:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226695441] [2024-11-10 01:13:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226695441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:13:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020859526] [2024-11-10 01:13:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:13:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:13:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:13:03,998 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:04,568 INFO L93 Difference]: Finished difference Result 1170 states and 1743 transitions. [2024-11-10 01:13:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:13:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 01:13:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:04,573 INFO L225 Difference]: With dead ends: 1170 [2024-11-10 01:13:04,574 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 01:13:04,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:13:04,576 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 850 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:04,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 3677 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:13:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 01:13:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2024-11-10 01:13:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 1.4925619834710744) internal successors, (903), 605 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 903 transitions. [2024-11-10 01:13:04,593 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 903 transitions. Word has length 64 [2024-11-10 01:13:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:04,595 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 903 transitions. [2024-11-10 01:13:04,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 903 transitions. [2024-11-10 01:13:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 01:13:04,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:04,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:04,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:13:04,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:04,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1557190215, now seen corresponding path program 1 times [2024-11-10 01:13:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:04,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126299166] [2024-11-10 01:13:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126299166] [2024-11-10 01:13:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126299166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:13:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213940555] [2024-11-10 01:13:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:13:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:04,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:13:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:04,836 INFO L87 Difference]: Start difference. First operand 606 states and 903 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:05,283 INFO L93 Difference]: Finished difference Result 1174 states and 1750 transitions. [2024-11-10 01:13:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:13:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 01:13:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:05,286 INFO L225 Difference]: With dead ends: 1174 [2024-11-10 01:13:05,287 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 01:13:05,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:05,289 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 4 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:05,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2939 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:13:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 01:13:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2024-11-10 01:13:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.4909390444810544) internal successors, (905), 607 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 905 transitions. [2024-11-10 01:13:05,306 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 905 transitions. Word has length 65 [2024-11-10 01:13:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 905 transitions. [2024-11-10 01:13:05,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 905 transitions. [2024-11-10 01:13:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 01:13:05,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:05,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:13:05,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1392481246, now seen corresponding path program 1 times [2024-11-10 01:13:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661361623] [2024-11-10 01:13:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:05,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:05,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:05,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661361623] [2024-11-10 01:13:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661361623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:13:05,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022230997] [2024-11-10 01:13:05,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:05,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:13:05,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:05,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:13:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:13:05,516 INFO L87 Difference]: Start difference. First operand 608 states and 905 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:06,266 INFO L93 Difference]: Finished difference Result 1734 states and 2588 transitions. [2024-11-10 01:13:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:13:06,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 01:13:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:06,269 INFO L225 Difference]: With dead ends: 1734 [2024-11-10 01:13:06,270 INFO L226 Difference]: Without dead ends: 620 [2024-11-10 01:13:06,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:13:06,272 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 807 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:06,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 3724 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:13:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-10 01:13:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 615. [2024-11-10 01:13:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.490228013029316) internal successors, (915), 614 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 915 transitions. [2024-11-10 01:13:06,287 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 915 transitions. Word has length 66 [2024-11-10 01:13:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:06,288 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 915 transitions. [2024-11-10 01:13:06,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 915 transitions. [2024-11-10 01:13:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 01:13:06,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:06,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:06,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:13:06,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash -472946082, now seen corresponding path program 1 times [2024-11-10 01:13:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614718577] [2024-11-10 01:13:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614718577] [2024-11-10 01:13:06,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614718577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:06,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:13:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658862175] [2024-11-10 01:13:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:06,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:13:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:13:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:06,455 INFO L87 Difference]: Start difference. First operand 615 states and 915 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:06,863 INFO L93 Difference]: Finished difference Result 1215 states and 1808 transitions. [2024-11-10 01:13:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:13:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 01:13:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:06,868 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 01:13:06,869 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 01:13:06,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:06,871 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 64 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:06,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2903 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:13:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 01:13:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-10 01:13:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4882995319812793) internal successors, (954), 641 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 954 transitions. [2024-11-10 01:13:06,885 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 954 transitions. Word has length 66 [2024-11-10 01:13:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:06,885 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 954 transitions. [2024-11-10 01:13:06,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 954 transitions. [2024-11-10 01:13:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 01:13:06,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:06,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:06,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:13:06,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:06,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2038852676, now seen corresponding path program 1 times [2024-11-10 01:13:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:06,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470091454] [2024-11-10 01:13:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:07,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470091454] [2024-11-10 01:13:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470091454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:07,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:07,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:07,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436504413] [2024-11-10 01:13:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:07,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:07,044 INFO L87 Difference]: Start difference. First operand 642 states and 954 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:07,400 INFO L93 Difference]: Finished difference Result 1217 states and 1810 transitions. [2024-11-10 01:13:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:07,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 01:13:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:07,404 INFO L225 Difference]: With dead ends: 1217 [2024-11-10 01:13:07,404 INFO L226 Difference]: Without dead ends: 642 [2024-11-10 01:13:07,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:07,406 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 851 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:07,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1425 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:13:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-10 01:13:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-11-10 01:13:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4867394695787832) internal successors, (953), 641 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 953 transitions. [2024-11-10 01:13:07,420 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 953 transitions. Word has length 67 [2024-11-10 01:13:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:07,420 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 953 transitions. [2024-11-10 01:13:07,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 953 transitions. [2024-11-10 01:13:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 01:13:07,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:07,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:07,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:13:07,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:07,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:07,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2014162849, now seen corresponding path program 1 times [2024-11-10 01:13:07,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:07,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933905448] [2024-11-10 01:13:07,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:07,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933905448] [2024-11-10 01:13:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933905448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:13:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861058586] [2024-11-10 01:13:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:07,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:13:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:13:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:07,621 INFO L87 Difference]: Start difference. First operand 642 states and 953 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:07,987 INFO L93 Difference]: Finished difference Result 1214 states and 1805 transitions. [2024-11-10 01:13:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 01:13:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:07,990 INFO L225 Difference]: With dead ends: 1214 [2024-11-10 01:13:07,990 INFO L226 Difference]: Without dead ends: 641 [2024-11-10 01:13:07,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:07,992 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 1675 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:07,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 1400 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:13:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-10 01:13:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 635. [2024-11-10 01:13:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4810725552050472) internal successors, (939), 634 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 939 transitions. [2024-11-10 01:13:08,006 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 939 transitions. Word has length 67 [2024-11-10 01:13:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:08,007 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 939 transitions. [2024-11-10 01:13:08,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 939 transitions. [2024-11-10 01:13:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 01:13:08,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:08,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:08,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:13:08,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:08,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1923081580, now seen corresponding path program 1 times [2024-11-10 01:13:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304248782] [2024-11-10 01:13:08,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:08,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:08,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:08,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304248782] [2024-11-10 01:13:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304248782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:08,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622412921] [2024-11-10 01:13:08,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:08,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:08,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:08,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:08,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:08,171 INFO L87 Difference]: Start difference. First operand 635 states and 939 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:08,424 INFO L93 Difference]: Finished difference Result 1200 states and 1776 transitions. [2024-11-10 01:13:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 01:13:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:08,427 INFO L225 Difference]: With dead ends: 1200 [2024-11-10 01:13:08,427 INFO L226 Difference]: Without dead ends: 634 [2024-11-10 01:13:08,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:08,428 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 844 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:08,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1463 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:13:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-10 01:13:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2024-11-10 01:13:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4802527646129542) internal successors, (937), 633 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 937 transitions. [2024-11-10 01:13:08,441 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 937 transitions. Word has length 67 [2024-11-10 01:13:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:08,441 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 937 transitions. [2024-11-10 01:13:08,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 937 transitions. [2024-11-10 01:13:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 01:13:08,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:08,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:08,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:13:08,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:08,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1328084302, now seen corresponding path program 1 times [2024-11-10 01:13:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:08,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476597600] [2024-11-10 01:13:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476597600] [2024-11-10 01:13:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476597600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:13:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2298207] [2024-11-10 01:13:08,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:13:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:08,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:13:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:13:08,894 INFO L87 Difference]: Start difference. First operand 634 states and 937 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:09,963 INFO L93 Difference]: Finished difference Result 1215 states and 1795 transitions. [2024-11-10 01:13:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:13:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 01:13:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:09,966 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 01:13:09,967 INFO L226 Difference]: Without dead ends: 650 [2024-11-10 01:13:09,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:13:09,969 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 858 mSDsluCounter, 5648 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 6372 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:09,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 6372 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:13:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-10 01:13:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 645. [2024-11-10 01:13:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4751552795031055) internal successors, (950), 644 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 950 transitions. [2024-11-10 01:13:09,985 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 950 transitions. Word has length 68 [2024-11-10 01:13:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:09,986 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 950 transitions. [2024-11-10 01:13:09,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 950 transitions. [2024-11-10 01:13:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 01:13:09,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:09,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:09,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:13:09,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:09,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1818719624, now seen corresponding path program 1 times [2024-11-10 01:13:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330276537] [2024-11-10 01:13:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330276537] [2024-11-10 01:13:10,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330276537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:10,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:13:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38199803] [2024-11-10 01:13:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:10,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:13:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:10,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:13:10,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:13:10,191 INFO L87 Difference]: Start difference. First operand 645 states and 950 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:10,701 INFO L93 Difference]: Finished difference Result 1225 states and 1805 transitions. [2024-11-10 01:13:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:13:10,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 01:13:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:10,704 INFO L225 Difference]: With dead ends: 1225 [2024-11-10 01:13:10,704 INFO L226 Difference]: Without dead ends: 649 [2024-11-10 01:13:10,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:13:10,706 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 9 mSDsluCounter, 2879 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3606 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:10,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3606 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:13:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-10 01:13:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-10 01:13:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.4744186046511627) internal successors, (951), 645 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 951 transitions. [2024-11-10 01:13:10,721 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 951 transitions. Word has length 68 [2024-11-10 01:13:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 951 transitions. [2024-11-10 01:13:10,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 951 transitions. [2024-11-10 01:13:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 01:13:10,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:10,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:10,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:13:10,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:10,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1810364867, now seen corresponding path program 1 times [2024-11-10 01:13:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:10,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117298241] [2024-11-10 01:13:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117298241] [2024-11-10 01:13:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117298241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:11,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:11,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 01:13:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772786764] [2024-11-10 01:13:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 01:13:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:11,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 01:13:11,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:13:11,175 INFO L87 Difference]: Start difference. First operand 646 states and 951 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:12,021 INFO L93 Difference]: Finished difference Result 1234 states and 1816 transitions. [2024-11-10 01:13:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:13:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 01:13:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:12,024 INFO L225 Difference]: With dead ends: 1234 [2024-11-10 01:13:12,024 INFO L226 Difference]: Without dead ends: 657 [2024-11-10 01:13:12,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:13:12,025 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 866 mSDsluCounter, 4954 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:12,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 5679 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 01:13:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-10 01:13:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 649. [2024-11-10 01:13:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4737654320987654) internal successors, (955), 648 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 955 transitions. [2024-11-10 01:13:12,037 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 955 transitions. Word has length 69 [2024-11-10 01:13:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:12,037 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 955 transitions. [2024-11-10 01:13:12,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 955 transitions. [2024-11-10 01:13:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 01:13:12,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:12,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:12,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:13:12,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:12,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1404059277, now seen corresponding path program 1 times [2024-11-10 01:13:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739533694] [2024-11-10 01:13:12,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739533694] [2024-11-10 01:13:12,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739533694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:12,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:12,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:13:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038815980] [2024-11-10 01:13:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:12,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:13:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:13:12,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:13:12,252 INFO L87 Difference]: Start difference. First operand 649 states and 955 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:12,863 INFO L93 Difference]: Finished difference Result 1238 states and 1820 transitions. [2024-11-10 01:13:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:13:12,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 01:13:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:12,866 INFO L225 Difference]: With dead ends: 1238 [2024-11-10 01:13:12,866 INFO L226 Difference]: Without dead ends: 658 [2024-11-10 01:13:12,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:13:12,867 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 6 mSDsluCounter, 4306 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:12,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5027 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:13:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-10 01:13:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2024-11-10 01:13:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.4702290076335878) internal successors, (963), 655 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 963 transitions. [2024-11-10 01:13:12,901 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 963 transitions. Word has length 70 [2024-11-10 01:13:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 963 transitions. [2024-11-10 01:13:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 963 transitions. [2024-11-10 01:13:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 01:13:12,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:12,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:13:12,903 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:12,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1454501751, now seen corresponding path program 1 times [2024-11-10 01:13:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519488586] [2024-11-10 01:13:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519488586] [2024-11-10 01:13:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519488586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:13:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001083439] [2024-11-10 01:13:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:13:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:13,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:13:13,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:13:13,101 INFO L87 Difference]: Start difference. First operand 656 states and 963 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:13,983 INFO L93 Difference]: Finished difference Result 1775 states and 2607 transitions. [2024-11-10 01:13:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:13:13,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 01:13:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:13,987 INFO L225 Difference]: With dead ends: 1775 [2024-11-10 01:13:13,987 INFO L226 Difference]: Without dead ends: 1188 [2024-11-10 01:13:13,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:13:13,989 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 797 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:13,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2183 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 01:13:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2024-11-10 01:13:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 709. [2024-11-10 01:13:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.4533898305084745) internal successors, (1029), 708 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1029 transitions. [2024-11-10 01:13:14,005 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1029 transitions. Word has length 70 [2024-11-10 01:13:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:14,006 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1029 transitions. [2024-11-10 01:13:14,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1029 transitions. [2024-11-10 01:13:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 01:13:14,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:14,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:14,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:13:14,007 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:14,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1630316229, now seen corresponding path program 1 times [2024-11-10 01:13:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:14,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298614932] [2024-11-10 01:13:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:14,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298614932] [2024-11-10 01:13:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298614932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:14,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:13:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866522451] [2024-11-10 01:13:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:14,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:13:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:13:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:13:14,424 INFO L87 Difference]: Start difference. First operand 709 states and 1029 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:15,539 INFO L93 Difference]: Finished difference Result 1842 states and 2701 transitions. [2024-11-10 01:13:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:13:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 01:13:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:15,542 INFO L225 Difference]: With dead ends: 1842 [2024-11-10 01:13:15,542 INFO L226 Difference]: Without dead ends: 1236 [2024-11-10 01:13:15,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:13:15,544 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 2320 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 4850 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:15,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2320 Valid, 4850 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:13:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-11-10 01:13:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 725. [2024-11-10 01:13:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4433701657458564) internal successors, (1045), 724 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1045 transitions. [2024-11-10 01:13:15,558 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1045 transitions. Word has length 71 [2024-11-10 01:13:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:15,558 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1045 transitions. [2024-11-10 01:13:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1045 transitions. [2024-11-10 01:13:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 01:13:15,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:15,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:15,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:13:15,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 440692081, now seen corresponding path program 1 times [2024-11-10 01:13:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696135965] [2024-11-10 01:13:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:15,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696135965] [2024-11-10 01:13:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696135965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:15,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:15,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:13:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765047098] [2024-11-10 01:13:15,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:15,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:13:15,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:13:15,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:13:15,997 INFO L87 Difference]: Start difference. First operand 725 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:16,664 INFO L93 Difference]: Finished difference Result 1331 states and 1929 transitions. [2024-11-10 01:13:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:13:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-10 01:13:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:16,667 INFO L225 Difference]: With dead ends: 1331 [2024-11-10 01:13:16,667 INFO L226 Difference]: Without dead ends: 736 [2024-11-10 01:13:16,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:13:16,669 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 826 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:16,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 3519 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:13:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-10 01:13:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2024-11-10 01:13:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4433701657458564) internal successors, (1045), 724 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1045 transitions. [2024-11-10 01:13:16,683 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1045 transitions. Word has length 72 [2024-11-10 01:13:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:16,684 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1045 transitions. [2024-11-10 01:13:16,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1045 transitions. [2024-11-10 01:13:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 01:13:16,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:16,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:16,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:13:16,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:16,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1467425234, now seen corresponding path program 1 times [2024-11-10 01:13:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874925930] [2024-11-10 01:13:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874925930] [2024-11-10 01:13:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874925930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:13:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527749081] [2024-11-10 01:13:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:13:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:13:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:13:16,950 INFO L87 Difference]: Start difference. First operand 725 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:17,566 INFO L93 Difference]: Finished difference Result 1359 states and 1963 transitions. [2024-11-10 01:13:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:13:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 01:13:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:17,569 INFO L225 Difference]: With dead ends: 1359 [2024-11-10 01:13:17,569 INFO L226 Difference]: Without dead ends: 735 [2024-11-10 01:13:17,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:13:17,571 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 870 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:17,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 4169 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:13:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-10 01:13:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2024-11-10 01:13:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4401650618982118) internal successors, (1047), 727 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1047 transitions. [2024-11-10 01:13:17,584 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1047 transitions. Word has length 73 [2024-11-10 01:13:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:17,584 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1047 transitions. [2024-11-10 01:13:17,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1047 transitions. [2024-11-10 01:13:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 01:13:17,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:17,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:17,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:13:17,586 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:17,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash -934545917, now seen corresponding path program 1 times [2024-11-10 01:13:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792643473] [2024-11-10 01:13:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792643473] [2024-11-10 01:13:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792643473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:13:17,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251950159] [2024-11-10 01:13:17,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:17,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:13:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:13:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:13:17,823 INFO L87 Difference]: Start difference. First operand 728 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:18,322 INFO L93 Difference]: Finished difference Result 1344 states and 1944 transitions. [2024-11-10 01:13:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:13:18,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 01:13:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:18,325 INFO L225 Difference]: With dead ends: 1344 [2024-11-10 01:13:18,325 INFO L226 Difference]: Without dead ends: 735 [2024-11-10 01:13:18,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:13:18,326 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 5 mSDsluCounter, 4336 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5064 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5064 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:13:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-10 01:13:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 718. [2024-11-10 01:13:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4463040446304045) internal successors, (1037), 717 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2024-11-10 01:13:18,339 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 73 [2024-11-10 01:13:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:18,340 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2024-11-10 01:13:18,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2024-11-10 01:13:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 01:13:18,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:18,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:18,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:13:18,342 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:18,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1369484893, now seen corresponding path program 1 times [2024-11-10 01:13:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:18,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412008808] [2024-11-10 01:13:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:13:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412008808] [2024-11-10 01:13:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412008808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273867763] [2024-11-10 01:13:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:13:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:18,501 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:18,757 INFO L93 Difference]: Finished difference Result 1329 states and 1928 transitions. [2024-11-10 01:13:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 01:13:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:18,760 INFO L225 Difference]: With dead ends: 1329 [2024-11-10 01:13:18,760 INFO L226 Difference]: Without dead ends: 718 [2024-11-10 01:13:18,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:18,762 INFO L432 NwaCegarLoop]: 708 mSDtfsCounter, 872 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:18,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1409 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:13:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-10 01:13:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-10 01:13:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4435146443514644) internal successors, (1035), 717 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1035 transitions. [2024-11-10 01:13:18,775 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1035 transitions. Word has length 73 [2024-11-10 01:13:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:18,775 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1035 transitions. [2024-11-10 01:13:18,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1035 transitions. [2024-11-10 01:13:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 01:13:18,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:18,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:13:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:13:18,777 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1820179005, now seen corresponding path program 1 times [2024-11-10 01:13:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:13:18,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615618229] [2024-11-10 01:13:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:13:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:13:18,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 01:13:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:13:18,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 01:13:18,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 01:13:18,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:13:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:13:18,921 INFO L407 BasicCegarLoop]: Path program histogram: [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 01:13:19,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:13:19,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:13:19 BoogieIcfgContainer [2024-11-10 01:13:19,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:13:19,007 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:13:19,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:13:19,008 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:13:19,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:12:59" (3/4) ... [2024-11-10 01:13:19,011 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 01:13:19,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:13:19,012 INFO L158 Benchmark]: Toolchain (without parser) took 22692.42ms. Allocated memory was 155.2MB in the beginning and 559.9MB in the end (delta: 404.8MB). Free memory was 121.9MB in the beginning and 310.1MB in the end (delta: -188.1MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,012 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 123.2MB in the end (delta: 178.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.56ms. Allocated memory is still 155.2MB. Free memory was 121.9MB in the beginning and 93.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 251.04ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 98.6MB in the end (delta: -5.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,013 INFO L158 Benchmark]: Boogie Preprocessor took 287.20ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 98.6MB in the beginning and 146.8MB in the end (delta: -48.2MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,014 INFO L158 Benchmark]: IcfgBuilder took 2589.31ms. Allocated memory was 203.4MB in the beginning and 312.5MB in the end (delta: 109.1MB). Free memory was 146.8MB in the beginning and 219.2MB in the end (delta: -72.4MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,014 INFO L158 Benchmark]: TraceAbstraction took 19019.70ms. Allocated memory was 312.5MB in the beginning and 559.9MB in the end (delta: 247.5MB). Free memory was 219.2MB in the beginning and 311.1MB in the end (delta: -91.9MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,014 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 559.9MB. Free memory was 311.1MB in the beginning and 310.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 01:13:19,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 123.2MB in the end (delta: 178.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.56ms. Allocated memory is still 155.2MB. Free memory was 121.9MB in the beginning and 93.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 251.04ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 98.6MB in the end (delta: -5.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 287.20ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 98.6MB in the beginning and 146.8MB in the end (delta: -48.2MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2589.31ms. Allocated memory was 203.4MB in the beginning and 312.5MB in the end (delta: 109.1MB). Free memory was 146.8MB in the beginning and 219.2MB in the end (delta: -72.4MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19019.70ms. Allocated memory was 312.5MB in the beginning and 559.9MB in the end (delta: 247.5MB). Free memory was 219.2MB in the beginning and 311.1MB in the end (delta: -91.9MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 559.9MB. Free memory was 311.1MB in the beginning and 310.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 949; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 600; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=949, var_28=1, var_30=0, var_32=16, var_5=0, var_79=600] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=600] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_30=0, var_32=16, var_79=600] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=600] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_79=600] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=600] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=600] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=600] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_79=600] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_79=600] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=600] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=600] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33=-2, var_33_arg_1=16, var_79=600] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=600] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=600] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33=949, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=600] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33=949, var_33_arg_1=16, var_34=1, var_79=600] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33=949, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=600] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33=949, var_33_arg_1=16, var_79=600] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=949, var_28=1, var_29=1, var_30=0, var_32=16, var_33=949, var_33_arg_1=16, var_79=600] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 600 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13383 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13383 mSDsluCounter, 69003 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53164 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16997 IncrementalHoareTripleChecker+Invalid, 17037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 15839 mSDtfsCounter, 16997 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=20, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1060 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1550 NumberOfCodeBlocks, 1550 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1454 ConstructedInterpolants, 0 QuantifiedInterpolants, 5295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 01:13:19,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash e17c5b3ed60cb499b39cb2b1e8b8a9f98620b54414dc6e7bf682fa48216723e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:13:21,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:13:21,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 01:13:21,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:13:21,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:13:21,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:13:21,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:13:21,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:13:21,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:13:21,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:13:21,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:13:21,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:13:21,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:13:21,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:13:21,651 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:13:21,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:13:21,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:13:21,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:13:21,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:13:21,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:13:21,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:13:21,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 01:13:21,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 01:13:21,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:13:21,658 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 01:13:21,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:13:21,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:13:21,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:13:21,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:13:21,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:13:21,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:13:21,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:13:21,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:13:21,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:13:21,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:13:21,670 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 01:13:21,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 01:13:21,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:13:21,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:13:21,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:13:21,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:13:21,673 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e17c5b3ed60cb499b39cb2b1e8b8a9f98620b54414dc6e7bf682fa48216723e3 [2024-11-10 01:13:22,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:13:22,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:13:22,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:13:22,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:13:22,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:13:22,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c [2024-11-10 01:13:23,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:13:24,127 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:13:24,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c [2024-11-10 01:13:24,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce839e1a0/8273073a632b4e1b866fb5dc229530d6/FLAG9bf8cafdf [2024-11-10 01:13:24,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce839e1a0/8273073a632b4e1b866fb5dc229530d6 [2024-11-10 01:13:24,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:13:24,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:13:24,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:13:24,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:13:24,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:13:24,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:13:24" (1/1) ... [2024-11-10 01:13:24,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6adbe7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:24, skipping insertion in model container [2024-11-10 01:13:24,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:13:24" (1/1) ... [2024-11-10 01:13:24,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:13:24,737 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/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c[1173,1186] [2024-11-10 01:13:24,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:13:24,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:13:24,941 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/hardware-verification-bv/btor2c-lazyMod.adding.6.prop1-func-interl.c[1173,1186] [2024-11-10 01:13:24,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:13:25,007 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:13:25,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25 WrapperNode [2024-11-10 01:13:25,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:13:25,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:13:25,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:13:25,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:13:25,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,117 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2024-11-10 01:13:25,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:13:25,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:13:25,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:13:25,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:13:25,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,181 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 01:13:25,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:13:25,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:13:25,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:13:25,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:13:25,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (1/1) ... [2024-11-10 01:13:25,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:13:25,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:13:25,263 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 01:13:25,267 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 01:13:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:13:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 01:13:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:13:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:13:25,456 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:13:25,459 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:13:25,980 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-10 01:13:25,980 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:13:25,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:13:25,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:13:25,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:13:25 BoogieIcfgContainer [2024-11-10 01:13:25,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:13:25,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:13:25,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:13:26,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:13:26,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:13:24" (1/3) ... [2024-11-10 01:13:26,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1822fc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:13:26, skipping insertion in model container [2024-11-10 01:13:26,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:25" (2/3) ... [2024-11-10 01:13:26,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1822fc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:13:26, skipping insertion in model container [2024-11-10 01:13:26,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:13:25" (3/3) ... [2024-11-10 01:13:26,006 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.6.prop1-func-interl.c [2024-11-10 01:13:26,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:13:26,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:13:26,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:13:26,085 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;@34983f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:13:26,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:13:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 01:13:26,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:26,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 01:13:26,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:26,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 01:13:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:13:26,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763263375] [2024-11-10 01:13:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:26,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:13:26,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:13:26,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 01:13:26,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 01:13:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:26,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 01:13:26,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:13:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:26,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:13:26,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:13:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763263375] [2024-11-10 01:13:26,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763263375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:13:26,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:13:26,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:13:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006084754] [2024-11-10 01:13:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:13:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:13:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:13:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:13:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:26,747 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:13:26,839 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 01:13:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:13:26,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 01:13:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:13:26,848 INFO L225 Difference]: With dead ends: 21 [2024-11-10 01:13:26,848 INFO L226 Difference]: Without dead ends: 10 [2024-11-10 01:13:26,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:13:26,854 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:13:26,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:13:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-10 01:13:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 01:13:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 01:13:26,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 01:13:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:13:26,881 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 01:13:26,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:13:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 01:13:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 01:13:26,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:13:26,883 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:13:26,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 01:13:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:13:27,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:13:27,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:13:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 01:13:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:13:27,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523279247] [2024-11-10 01:13:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:13:27,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 01:13:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:13:27,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 01:13:27,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 01:13:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:13:27,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 01:13:27,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:13:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:13:30,156 INFO L311 TraceCheckSpWp]: Computing backward predicates...