./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.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 a9bfc0bfd402f01a909df8198af653a6c40e8b771ded2d89ed782f9da2aa5bbb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:58:29,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:58:29,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:58:29,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:58:29,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:58:29,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:58:29,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:58:29,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:58:29,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:58:29,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:58:29,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:58:29,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:58:29,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:58:29,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:58:29,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:58:29,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:58:29,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:58:29,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:58:29,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:58:29,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:58:29,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:58:29,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:58:29,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:58:29,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:58:29,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:58:29,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:58:29,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:58:29,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:58:29,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:58:29,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:58:29,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:58:29,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:58:29,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:58:29,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:58:29,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:58:29,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:58:29,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:58:29,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:58:29,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:58:29,562 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 -> a9bfc0bfd402f01a909df8198af653a6c40e8b771ded2d89ed782f9da2aa5bbb [2024-11-16 10:58:29,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:58:29,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:58:29,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:58:29,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:58:29,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:58:29,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-16 10:58:31,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:58:31,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:58:31,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-16 10:58:31,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7933e27/432a076c959549069126b39141890d9b/FLAG987548a1d [2024-11-16 10:58:31,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7933e27/432a076c959549069126b39141890d9b [2024-11-16 10:58:31,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:58:31,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:58:31,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:58:31,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:58:31,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:58:31,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:31,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11866dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31, skipping insertion in model container [2024-11-16 10:58:31,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:31,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:58:31,906 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.factorial4even.c[1439,1452] [2024-11-16 10:58:31,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:58:31,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:58:31,945 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.factorial4even.c[1439,1452] [2024-11-16 10:58:31,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:58:31,967 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:58:31,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31 WrapperNode [2024-11-16 10:58:31,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:58:31,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:58:31,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:58:31,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:58:31,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:31,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,013 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2024-11-16 10:58:32,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:58:32,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:58:32,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:58:32,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:58:32,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,037 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:58:32,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:58:32,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:58:32,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:58:32,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:58:32,052 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (1/1) ... [2024-11-16 10:58:32,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:58:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:58:32,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:58:32,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:58:32,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:58:32,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:58:32,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:58:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:58:32,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 10:58:32,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 10:58:32,211 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:58:32,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:58:32,473 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-16 10:58:32,473 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:58:32,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:58:32,499 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:58:32,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:58:32 BoogieIcfgContainer [2024-11-16 10:58:32,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:58:32,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:58:32,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:58:32,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:58:32,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:58:31" (1/3) ... [2024-11-16 10:58:32,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f2b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:32, skipping insertion in model container [2024-11-16 10:58:32,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:58:31" (2/3) ... [2024-11-16 10:58:32,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f2b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:58:32, skipping insertion in model container [2024-11-16 10:58:32,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:58:32" (3/3) ... [2024-11-16 10:58:32,506 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-16 10:58:32,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:58:32,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:58:32,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:58:32,572 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;@4e6ce70a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:58:32,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:58:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 10:58:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 10:58:32,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:32,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:32,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:32,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1961242056, now seen corresponding path program 1 times [2024-11-16 10:58:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:32,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739105514] [2024-11-16 10:58:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,076 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-16 10:58:33,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:33,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739105514] [2024-11-16 10:58:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739105514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:58:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:58:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:58:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320231499] [2024-11-16 10:58:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:58:33,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:58:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:33,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:58:33,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:58:33,103 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:58:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:33,255 INFO L93 Difference]: Finished difference Result 84 states and 118 transitions. [2024-11-16 10:58:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:58:33,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-16 10:58:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:33,265 INFO L225 Difference]: With dead ends: 84 [2024-11-16 10:58:33,265 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 10:58:33,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:58:33,271 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:33,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 164 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:58:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 10:58:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2024-11-16 10:58:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 10:58:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-16 10:58:33,304 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 12 [2024-11-16 10:58:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:33,304 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-16 10:58:33,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:58:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-11-16 10:58:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 10:58:33,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:33,306 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:33,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:58:33,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1750736230, now seen corresponding path program 1 times [2024-11-16 10:58:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680401849] [2024-11-16 10:58:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:58:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680401849] [2024-11-16 10:58:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680401849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:58:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:58:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:58:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226715977] [2024-11-16 10:58:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:58:33,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:58:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:58:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:58:33,450 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 10:58:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:33,640 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-11-16 10:58:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:58:33,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-16 10:58:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:33,646 INFO L225 Difference]: With dead ends: 54 [2024-11-16 10:58:33,646 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 10:58:33,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-16 10:58:33,647 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:33,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:58:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 10:58:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-11-16 10:58:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 10:58:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-16 10:58:33,662 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 22 [2024-11-16 10:58:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:33,664 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-16 10:58:33,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 10:58:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-16 10:58:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 10:58:33,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:33,668 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:33,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:58:33,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2063236961, now seen corresponding path program 1 times [2024-11-16 10:58:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550120729] [2024-11-16 10:58:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:58:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550120729] [2024-11-16 10:58:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550120729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:58:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:58:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:58:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852157113] [2024-11-16 10:58:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:58:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:58:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:58:33,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:58:33,748 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 10:58:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:33,772 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2024-11-16 10:58:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:58:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-16 10:58:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:33,774 INFO L225 Difference]: With dead ends: 78 [2024-11-16 10:58:33,774 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 10:58:33,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-16 10:58:33,775 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:33,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:58:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 10:58:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-16 10:58:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 10:58:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-16 10:58:33,781 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 23 [2024-11-16 10:58:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:33,781 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-16 10:58:33,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 10:58:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-16 10:58:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 10:58:33,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:33,782 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:58:33,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1090995551, now seen corresponding path program 1 times [2024-11-16 10:58:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429318108] [2024-11-16 10:58:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:58:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:33,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429318108] [2024-11-16 10:58:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429318108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:58:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:58:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:58:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526401027] [2024-11-16 10:58:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:58:33,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:58:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:33,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:58:33,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:58:33,994 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 10:58:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:34,067 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-11-16 10:58:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:58:34,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-16 10:58:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:34,068 INFO L225 Difference]: With dead ends: 91 [2024-11-16 10:58:34,068 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 10:58:34,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:58:34,069 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:34,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 135 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:58:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 10:58:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2024-11-16 10:58:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 10:58:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-11-16 10:58:34,075 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 24 [2024-11-16 10:58:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:34,076 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-11-16 10:58:34,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 10:58:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-11-16 10:58:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 10:58:34,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:34,077 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:58:34,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1093957797, now seen corresponding path program 1 times [2024-11-16 10:58:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458483237] [2024-11-16 10:58:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 10:58:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 10:58:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458483237] [2024-11-16 10:58:34,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458483237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:58:34,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:58:34,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:58:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463201530] [2024-11-16 10:58:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:58:34,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:58:34,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:58:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:58:34,248 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 10:58:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:34,334 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2024-11-16 10:58:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:58:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-16 10:58:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:34,336 INFO L225 Difference]: With dead ends: 91 [2024-11-16 10:58:34,337 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 10:58:34,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:58:34,339 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:34,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 72 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:58:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 10:58:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-16 10:58:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 10:58:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-11-16 10:58:34,352 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 31 [2024-11-16 10:58:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:34,352 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-11-16 10:58:34,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 10:58:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-11-16 10:58:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 10:58:34,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:34,354 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:34,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:58:34,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:34,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1051990069, now seen corresponding path program 1 times [2024-11-16 10:58:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122455985] [2024-11-16 10:58:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 10:58:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 10:58:34,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122455985] [2024-11-16 10:58:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122455985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:58:34,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:58:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:58:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572016524] [2024-11-16 10:58:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:58:34,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:58:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:34,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:58:34,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:58:34,542 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 10:58:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:34,607 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-16 10:58:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:58:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-16 10:58:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:34,608 INFO L225 Difference]: With dead ends: 91 [2024-11-16 10:58:34,609 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 10:58:34,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:58:34,610 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:34,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 72 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:58:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 10:58:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-16 10:58:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 10:58:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-11-16 10:58:34,616 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 32 [2024-11-16 10:58:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:34,616 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-11-16 10:58:34,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 10:58:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-11-16 10:58:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 10:58:34,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:34,617 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:34,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:58:34,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:34,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -373126582, now seen corresponding path program 1 times [2024-11-16 10:58:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816475638] [2024-11-16 10:58:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 10:58:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 10:58:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816475638] [2024-11-16 10:58:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816475638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:58:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383390351] [2024-11-16 10:58:34,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:34,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:58:34,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:58:34,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:58:34,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 10:58:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:35,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-16 10:58:35,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:58:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 10:58:35,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:58:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 10:58:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383390351] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:58:36,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:58:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 34 [2024-11-16 10:58:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725523923] [2024-11-16 10:58:36,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:58:36,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-16 10:58:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-16 10:58:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 10:58:36,113 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 34 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 33 states have internal predecessors, (65), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 10:58:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:36,773 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2024-11-16 10:58:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 10:58:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 33 states have internal predecessors, (65), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2024-11-16 10:58:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:36,776 INFO L225 Difference]: With dead ends: 140 [2024-11-16 10:58:36,776 INFO L226 Difference]: Without dead ends: 108 [2024-11-16 10:58:36,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 10:58:36,777 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 354 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:36,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 313 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:58:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-16 10:58:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2024-11-16 10:58:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 75 states have internal predecessors, (88), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 10:58:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2024-11-16 10:58:36,788 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 33 [2024-11-16 10:58:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:36,788 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2024-11-16 10:58:36,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 33 states have internal predecessors, (65), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 10:58:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2024-11-16 10:58:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 10:58:36,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:36,790 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:36,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 10:58:36,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:58:36,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:36,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:36,995 INFO L85 PathProgramCache]: Analyzing trace with hash -711822735, now seen corresponding path program 1 times [2024-11-16 10:58:36,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:36,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127785322] [2024-11-16 10:58:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:36,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:37,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:37,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 10:58:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 10:58:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:58:37,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127785322] [2024-11-16 10:58:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127785322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:58:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541167489] [2024-11-16 10:58:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:37,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:58:37,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:58:37,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:58:37,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 10:58:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:37,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-16 10:58:37,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:58:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 10:58:37,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:58:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:58:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541167489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:58:38,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:58:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2024-11-16 10:58:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210410727] [2024-11-16 10:58:38,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:58:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 10:58:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 10:58:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2024-11-16 10:58:38,482 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 10 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 10:58:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:39,518 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2024-11-16 10:58:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 10:58:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 10 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 45 [2024-11-16 10:58:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:39,521 INFO L225 Difference]: With dead ends: 152 [2024-11-16 10:58:39,523 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 10:58:39,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=501, Invalid=2579, Unknown=0, NotChecked=0, Total=3080 [2024-11-16 10:58:39,530 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 230 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:39,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 200 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:58:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 10:58:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-11-16 10:58:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 10:58:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-16 10:58:39,556 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 45 [2024-11-16 10:58:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:39,557 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-16 10:58:39,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 32 states have internal predecessors, (81), 10 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 10:58:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-16 10:58:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-16 10:58:39,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:39,561 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:39,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 10:58:39,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-16 10:58:39,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:39,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash 238425973, now seen corresponding path program 1 times [2024-11-16 10:58:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:39,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079450851] [2024-11-16 10:58:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:39,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 10:58:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 10:58:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 10:58:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 10:58:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:58:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:58:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079450851] [2024-11-16 10:58:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079450851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:58:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485506106] [2024-11-16 10:58:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:40,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:58:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:58:40,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:58:40,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 10:58:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:40,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-16 10:58:40,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:58:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-16 10:58:41,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:58:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 10:58:47,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485506106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:58:47,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:58:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 18] total 40 [2024-11-16 10:58:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114046637] [2024-11-16 10:58:47,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:58:47,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-16 10:58:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-16 10:58:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2024-11-16 10:58:47,023 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 40 states, 38 states have (on average 3.236842105263158) internal successors, (123), 40 states have internal predecessors, (123), 12 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-16 10:58:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:58:48,378 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2024-11-16 10:58:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 10:58:48,378 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 3.236842105263158) internal successors, (123), 40 states have internal predecessors, (123), 12 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) Word has length 74 [2024-11-16 10:58:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:58:48,379 INFO L225 Difference]: With dead ends: 189 [2024-11-16 10:58:48,379 INFO L226 Difference]: Without dead ends: 135 [2024-11-16 10:58:48,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=529, Invalid=2551, Unknown=0, NotChecked=0, Total=3080 [2024-11-16 10:58:48,381 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 246 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:58:48,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 293 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:58:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-16 10:58:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2024-11-16 10:58:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 112 states have internal predecessors, (130), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 10:58:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2024-11-16 10:58:48,392 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 74 [2024-11-16 10:58:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:58:48,392 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2024-11-16 10:58:48,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 3.236842105263158) internal successors, (123), 40 states have internal predecessors, (123), 12 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-16 10:58:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2024-11-16 10:58:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-16 10:58:48,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:58:48,393 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:58:48,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 10:58:48,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:58:48,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:58:48,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:58:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash 176190218, now seen corresponding path program 2 times [2024-11-16 10:58:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:58:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263572240] [2024-11-16 10:58:48,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:58:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:58:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 10:58:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 10:58:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 10:58:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 10:58:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 10:58:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:58:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:58:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:58:49,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:58:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263572240] [2024-11-16 10:58:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263572240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:58:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493664543] [2024-11-16 10:58:49,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:58:49,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:58:49,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:58:49,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:58:49,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 10:58:49,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:58:49,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:58:49,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-16 10:58:49,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:58:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 10:58:51,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:58:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-16 10:58:57,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493664543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:58:57,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:58:57,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 24] total 55 [2024-11-16 10:58:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736661429] [2024-11-16 10:58:57,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:58:57,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-16 10:58:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:58:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-16 10:58:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2672, Unknown=0, NotChecked=0, Total=2970 [2024-11-16 10:58:57,027 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 55 states, 50 states have (on average 2.64) internal successors, (132), 54 states have internal predecessors, (132), 15 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 10 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-16 10:59:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:59:02,253 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2024-11-16 10:59:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 10:59:02,253 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 50 states have (on average 2.64) internal successors, (132), 54 states have internal predecessors, (132), 15 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 10 states have call predecessors, (18), 12 states have call successors, (18) Word has length 75 [2024-11-16 10:59:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:59:02,254 INFO L225 Difference]: With dead ends: 181 [2024-11-16 10:59:02,254 INFO L226 Difference]: Without dead ends: 178 [2024-11-16 10:59:02,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=913, Invalid=5093, Unknown=0, NotChecked=0, Total=6006 [2024-11-16 10:59:02,256 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 482 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:59:02,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 531 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 10:59:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-16 10:59:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2024-11-16 10:59:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.217687074829932) internal successors, (179), 152 states have internal predecessors, (179), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 16 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 10:59:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2024-11-16 10:59:02,269 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 75 [2024-11-16 10:59:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:59:02,269 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2024-11-16 10:59:02,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 50 states have (on average 2.64) internal successors, (132), 54 states have internal predecessors, (132), 15 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 10 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-16 10:59:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2024-11-16 10:59:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-16 10:59:02,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:59:02,270 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:59:02,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 10:59:02,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:59:02,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:59:02,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:59:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1660500785, now seen corresponding path program 2 times [2024-11-16 10:59:02,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:59:02,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824721959] [2024-11-16 10:59:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:59:02,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:59:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 10:59:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76054364] [2024-11-16 10:59:02,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:59:02,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:59:02,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:59:02,577 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:59:02,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 10:59:02,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:59:02,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:59:02,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-16 10:59:02,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:59:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 38 proven. 57 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 10:59:05,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:59:52,391 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 255 |c_ULTIMATE.start_main_~mask_SORT_12~0#1|) 1) 256) 0)) (let ((.cse6 (mod |c_ULTIMATE.start_main_~var_16~0#1| 256)) (.cse0 (mod |c_ULTIMATE.start_main_~mask_SORT_12~0#1| 256)) (.cse1 (mod (* (mod |c_ULTIMATE.start_main_~state_3~0#1| 256) (mod |c_ULTIMATE.start_main_~state_4~0#1| 256)) 256)) (.cse7 (mod |c_ULTIMATE.start_main_~var_7~0#1| 256)) (.cse4 (mod |c_ULTIMATE.start_main_~mask_SORT_1~0#1| 256)) (.cse9 (mod |c_ULTIMATE.start_main_~var_2~0#1| 256))) (and (forall ((v_y_76 Int) (v_z_77 Int) (v_y_77 Int)) (let ((.cse8 (* v_y_77 256))) (let ((.cse2 (+ v_z_77 .cse9)) (.cse5 (+ .cse8 v_z_77 (* v_y_76 256))) (.cse3 (+ .cse8 v_z_77))) (or (not (= .cse0 (mod (* .cse1 v_z_77) 256))) (< 255 .cse2) (< 255 .cse3) (< v_z_77 0) (= .cse2 .cse4) (< .cse5 0) (< .cse2 (+ .cse6 1)) (< .cse7 .cse5) (< .cse3 0))))) (forall ((v_y_76 Int) (v_z_77 Int) (v_y_77 Int)) (let ((.cse13 (* v_y_77 256))) (let ((.cse12 (+ .cse13 v_z_77 (* v_y_76 256))) (.cse10 (+ v_z_77 .cse9)) (.cse11 (+ .cse13 v_z_77))) (or (< .cse10 (+ 257 .cse6)) (< 255 v_z_77) (not (= .cse0 (mod (* .cse1 v_z_77) 256))) (< 255 .cse11) (< .cse12 0) (< .cse7 .cse12) (= .cse10 (+ 256 .cse4)) (< .cse11 0)))))))) is different from true