./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:53:05,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:53:05,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:53:05,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:53:05,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:53:05,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:53:05,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:53:05,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:53:05,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:53:05,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:53:05,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:53:05,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:53:05,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:53:05,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:53:05,593 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:53:05,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:53:05,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:53:05,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:53:05,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:53:05,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:53:05,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:53:05,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:53:05,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:53:05,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:53:05,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:53:05,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:53:05,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:53:05,597 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:53:05,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:53:05,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:53:05,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:53:05,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:53:05,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:53:05,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:53:05,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:53:05,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:53:05,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:53:05,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:53:05,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:53:05,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:53:05,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:53:05,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:53:05,604 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:53:05,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:53:05,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:53:05,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:53:05,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:53:05,893 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:53:05,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2024-09-12 21:53:07,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:53:07,394 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:53:07,394 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2024-09-12 21:53:07,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/cbdabdc5e/d5f20fedca2943f5a4da68557dbda64a/FLAGac1f565c9 [2024-09-12 21:53:07,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/cbdabdc5e/d5f20fedca2943f5a4da68557dbda64a [2024-09-12 21:53:07,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:53:07,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:53:07,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:53:07,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:53:07,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:53:07,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:53:07" (1/1) ... [2024-09-12 21:53:07,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439102c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:07, skipping insertion in model container [2024-09-12 21:53:07,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:53:07" (1/1) ... [2024-09-12 21:53:07,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:53:07,985 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2024-09-12 21:53:08,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:53:08,013 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:53:08,022 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2024-09-12 21:53:08,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:53:08,039 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:53:08,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08 WrapperNode [2024-09-12 21:53:08,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:53:08,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:53:08,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:53:08,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:53:08,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,057 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:53:08,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:53:08,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:53:08,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:53:08,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:53:08,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,084 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-09-12 21:53:08,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:53:08,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:53:08,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:53:08,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:53:08,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (1/1) ... [2024-09-12 21:53:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:53:08,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:53:08,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:53:08,135 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:53:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:53:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:53:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:53:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:53:08,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:53:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:53:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:53:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:53:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:53:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:53:08,244 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:53:08,246 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:53:08,381 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-12 21:53:08,382 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:53:08,405 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:53:08,406 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 21:53:08,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:53:08 BoogieIcfgContainer [2024-09-12 21:53:08,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:53:08,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:53:08,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:53:08,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:53:08,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:53:07" (1/3) ... [2024-09-12 21:53:08,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd70e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:53:08, skipping insertion in model container [2024-09-12 21:53:08,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:53:08" (2/3) ... [2024-09-12 21:53:08,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd70e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:53:08, skipping insertion in model container [2024-09-12 21:53:08,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:53:08" (3/3) ... [2024-09-12 21:53:08,415 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2024-09-12 21:53:08,433 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:53:08,433 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:53:08,523 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:53:08,544 INFO L336 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=All, 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;@18cdecfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:53:08,544 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:53:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 21:53:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:53:08,584 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:08,585 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:08,588 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:08,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1330752012, now seen corresponding path program 1 times [2024-09-12 21:53:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:08,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594838389] [2024-09-12 21:53:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:08,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594838389] [2024-09-12 21:53:08,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594838389] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:53:08,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:53:08,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 21:53:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837218476] [2024-09-12 21:53:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:53:08,741 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 21:53:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:08,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 21:53:08,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:53:08,762 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:53:08,781 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 21:53:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 21:53:08,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:53:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:53:08,789 INFO L225 Difference]: With dead ends: 29 [2024-09-12 21:53:08,793 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 21:53:08,796 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:53:08,801 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:53:08,802 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:53:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 21:53:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 21:53:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 21:53:08,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 21:53:08,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:53:08,829 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 21:53:08,829 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:08,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 21:53:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:53:08,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:08,831 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:08,832 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:53:08,832 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:08,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1321516802, now seen corresponding path program 1 times [2024-09-12 21:53:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426156564] [2024-09-12 21:53:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:08,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426156564] [2024-09-12 21:53:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426156564] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:53:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:53:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:53:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290654018] [2024-09-12 21:53:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:53:09,011 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:53:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:53:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:53:09,013 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:53:09,032 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-12 21:53:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:53:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:53:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:53:09,034 INFO L225 Difference]: With dead ends: 21 [2024-09-12 21:53:09,034 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 21:53:09,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:53:09,036 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:53:09,039 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:53:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 21:53:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-12 21:53:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-09-12 21:53:09,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-09-12 21:53:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:53:09,046 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-09-12 21:53:09,046 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:09,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-09-12 21:53:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:53:09,047 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:09,047 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:09,048 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:53:09,048 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:09,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -257340833, now seen corresponding path program 1 times [2024-09-12 21:53:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225993781] [2024-09-12 21:53:09,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225993781] [2024-09-12 21:53:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225993781] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:53:09,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279846501] [2024-09-12 21:53:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:09,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:09,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:53:09,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:53:09,199 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 21:53:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 21:53:09,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:53:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:09,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:53:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:09,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279846501] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:53:09,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:53:09,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 10 [2024-09-12 21:53:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445077766] [2024-09-12 21:53:09,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:53:09,464 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 21:53:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:09,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 21:53:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 21:53:09,467 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:53:09,562 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-09-12 21:53:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 21:53:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 21:53:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:53:09,564 INFO L225 Difference]: With dead ends: 24 [2024-09-12 21:53:09,564 INFO L226 Difference]: Without dead ends: 17 [2024-09-12 21:53:09,565 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:53:09,566 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:53:09,566 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:53:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-12 21:53:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-12 21:53:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-12 21:53:09,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-09-12 21:53:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:53:09,576 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-12 21:53:09,576 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:09,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-12 21:53:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:53:09,578 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:09,578 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:09,595 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 21:53:09,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:09,780 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:09,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1791473815, now seen corresponding path program 1 times [2024-09-12 21:53:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816268064] [2024-09-12 21:53:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816268064] [2024-09-12 21:53:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816268064] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:53:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934817125] [2024-09-12 21:53:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:53:09,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:53:09,958 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 21:53:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:09,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 21:53:09,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:53:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:10,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:53:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934817125] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:53:10,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:53:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 14 [2024-09-12 21:53:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997143359] [2024-09-12 21:53:10,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:53:10,244 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 21:53:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:10,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 21:53:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-09-12 21:53:10,246 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:53:10,476 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-09-12 21:53:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 21:53:10,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 21:53:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:53:10,480 INFO L225 Difference]: With dead ends: 34 [2024-09-12 21:53:10,480 INFO L226 Difference]: Without dead ends: 23 [2024-09-12 21:53:10,481 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-09-12 21:53:10,482 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:53:10,484 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:53:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-12 21:53:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-12 21:53:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-09-12 21:53:10,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2024-09-12 21:53:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:53:10,495 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-09-12 21:53:10,495 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:10,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-09-12 21:53:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 21:53:10,499 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:10,499 INFO L216 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:10,516 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 21:53:10,699 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:10,700 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:10,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1608409002, now seen corresponding path program 2 times [2024-09-12 21:53:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:10,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144287130] [2024-09-12 21:53:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:10,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 21:53:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144287130] [2024-09-12 21:53:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144287130] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:53:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064917676] [2024-09-12 21:53:10,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:53:10,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:10,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:53:10,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:53:10,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 21:53:10,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:53:10,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:53:10,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 21:53:10,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:53:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:10,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:53:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:53:11,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064917676] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:53:11,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:53:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 16 [2024-09-12 21:53:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632836743] [2024-09-12 21:53:11,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:53:11,167 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 21:53:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 21:53:11,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-09-12 21:53:11,169 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:53:11,933 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-12 21:53:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 21:53:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-12 21:53:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:53:11,934 INFO L225 Difference]: With dead ends: 49 [2024-09-12 21:53:11,935 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 21:53:11,936 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2024-09-12 21:53:11,939 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:53:11,939 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:53:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 21:53:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-12 21:53:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-09-12 21:53:11,956 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2024-09-12 21:53:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:53:11,956 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-09-12 21:53:11,957 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:11,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-09-12 21:53:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 21:53:11,958 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:11,958 INFO L216 NwaCegarLoop]: trace histogram [13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:11,976 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 21:53:12,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:12,164 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:12,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 223404661, now seen corresponding path program 3 times [2024-09-12 21:53:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809436829] [2024-09-12 21:53:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:12,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 21:53:12,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:12,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809436829] [2024-09-12 21:53:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809436829] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:53:12,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926272074] [2024-09-12 21:53:12,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 21:53:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:53:12,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:53:12,410 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 21:53:12,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-09-12 21:53:12,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:53:12,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 21:53:12,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:53:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-09-12 21:53:12,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:53:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-09-12 21:53:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926272074] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:53:12,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:53:12,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 9] total 24 [2024-09-12 21:53:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36813162] [2024-09-12 21:53:12,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:53:12,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 21:53:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:12,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 21:53:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-09-12 21:53:12,809 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:17,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:53:21,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:53:25,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:53:29,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:53:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:53:29,639 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-09-12 21:53:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-12 21:53:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-09-12 21:53:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:53:29,641 INFO L225 Difference]: With dead ends: 76 [2024-09-12 21:53:29,641 INFO L226 Difference]: Without dead ends: 61 [2024-09-12 21:53:29,642 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=335, Invalid=855, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 21:53:29,643 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 26 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-09-12 21:53:29,643 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 352 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2024-09-12 21:53:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-12 21:53:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2024-09-12 21:53:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-09-12 21:53:29,666 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 36 [2024-09-12 21:53:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:53:29,667 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-09-12 21:53:29,667 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:53:29,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-09-12 21:53:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 21:53:29,668 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:53:29,668 INFO L216 NwaCegarLoop]: trace histogram [19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:53:29,687 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 21:53:29,869 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:29,869 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:53:29,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:53:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1147212569, now seen corresponding path program 4 times [2024-09-12 21:53:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:53:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117723131] [2024-09-12 21:53:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:53:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:53:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:30,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:53:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:53:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 180 proven. 132 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 21:53:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:53:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117723131] [2024-09-12 21:53:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117723131] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:53:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134914325] [2024-09-12 21:53:30,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 21:53:30,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:53:30,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:53:30,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:53:30,172 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 21:53:30,231 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 21:53:30,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:53:30,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-12 21:53:30,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:53:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:53:30,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:53:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:53:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134914325] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:53:31,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:53:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 21] total 40 [2024-09-12 21:53:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795918156] [2024-09-12 21:53:31,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:53:31,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-12 21:53:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:53:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-12 21:53:31,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1109, Unknown=0, NotChecked=0, Total=1560 [2024-09-12 21:53:31,698 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:54:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:54:08,400 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-09-12 21:54:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-12 21:54:08,401 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-12 21:54:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:54:08,402 INFO L225 Difference]: With dead ends: 109 [2024-09-12 21:54:08,402 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 21:54:08,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=1171, Invalid=2135, Unknown=0, NotChecked=0, Total=3306 [2024-09-12 21:54:08,404 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:54:08,405 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:54:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 21:54:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-12 21:54:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.1097560975609757) internal successors, (91), 82 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:54:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-09-12 21:54:08,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2024-09-12 21:54:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:54:08,426 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-09-12 21:54:08,427 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:54:08,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:54:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-09-12 21:54:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-12 21:54:08,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:54:08,429 INFO L216 NwaCegarLoop]: trace histogram [38, 30, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:54:08,449 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 21:54:08,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 21:54:08,630 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:54:08,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:54:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1990911488, now seen corresponding path program 5 times [2024-09-12 21:54:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:54:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666157717] [2024-09-12 21:54:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:54:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:54:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:54:09,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:54:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:54:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 465 proven. 930 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 21:54:09,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:54:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666157717] [2024-09-12 21:54:09,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666157717] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:54:09,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243341016] [2024-09-12 21:54:09,757 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 21:54:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:54:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:54:09,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:54:09,760 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 21:54:10,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2024-09-12 21:54:10,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:54:10,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-09-12 21:54:10,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:54:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 416 proven. 992 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 21:54:10,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:54:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 416 proven. 992 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 21:54:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243341016] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:54:12,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:54:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 35] total 68 [2024-09-12 21:54:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833605817] [2024-09-12 21:54:12,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:54:12,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-09-12 21:54:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:54:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-09-12 21:54:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1254, Invalid=3302, Unknown=0, NotChecked=0, Total=4556 [2024-09-12 21:54:12,511 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 68 states have internal predecessors, (140), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:54:51,884 WARN L293 SmtUtils]: Spent 17.58s on a formula simplification. DAG size of input: 193 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:55:24,410 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 187 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:55:52,928 WARN L293 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 181 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:56:19,839 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 175 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:56:45,164 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 169 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:57:10,174 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 163 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:57:33,904 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 157 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:57:57,147 WARN L293 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 151 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 22:01:00,938 WARN L293 SmtUtils]: Spent 9.54s on a formula simplification. DAG size of input: 195 DAG size of output: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 22:01:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:01:00,939 INFO L93 Difference]: Finished difference Result 175 states and 224 transitions. [2024-09-12 22:01:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-12 22:01:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 68 states have internal predecessors, (140), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-09-12 22:01:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:01:00,943 INFO L225 Difference]: With dead ends: 175 [2024-09-12 22:01:00,944 INFO L226 Difference]: Without dead ends: 153 [2024-09-12 22:01:00,947 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 409.8s TimeCoverageRelationStatistics Valid=3430, Invalid=6470, Unknown=0, NotChecked=0, Total=9900 [2024-09-12 22:01:00,948 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-12 22:01:00,948 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-12 22:01:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-09-12 22:01:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-09-12 22:01:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0608108108108107) internal successors, (157), 148 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:01:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2024-09-12 22:01:00,992 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 86 [2024-09-12 22:01:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:01:00,992 INFO L474 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2024-09-12 22:01:00,993 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 68 states have internal predecessors, (140), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:01:00,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:01:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2024-09-12 22:01:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-09-12 22:01:00,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:01:00,995 INFO L216 NwaCegarLoop]: trace histogram [71, 63, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:01:01,008 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 22:01:01,196 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:01:01,196 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:01:01,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:01:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1287691907, now seen corresponding path program 6 times [2024-09-12 22:01:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:01:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027420491] [2024-09-12 22:01:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:01:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:01:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:01:04,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:01:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:01:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 960 proven. 4032 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 22:01:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:01:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027420491] [2024-09-12 22:01:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027420491] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:01:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749693946] [2024-09-12 22:01:04,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 22:01:04,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:01:04,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:01:04,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:01:04,462 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 22:01:04,771 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2024-09-12 22:01:04,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:01:04,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 22:01:04,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:01:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 1071 proven. 64 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2024-09-12 22:01:05,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:01:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 1071 proven. 64 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2024-09-12 22:01:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749693946] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:01:06,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:01:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 11, 14] total 87 [2024-09-12 22:01:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577483382] [2024-09-12 22:01:06,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:01:06,644 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-09-12 22:01:06,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:01:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-09-12 22:01:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=6104, Unknown=0, NotChecked=0, Total=7482 [2024-09-12 22:01:06,650 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand has 87 states, 86 states have (on average 2.058139534883721) internal successors, (177), 86 states have internal predecessors, (177), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:01:16,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:20,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:24,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:28,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:32,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:40,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:45,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:49,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:53,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:01:57,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:01,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:05,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:09,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:13,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:17,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:21,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:25,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:29,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:34,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:38,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:42,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:46,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:50,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:54,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:02:58,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:02,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:06,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:10,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:14,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:18,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:22,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:26,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:30,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:34,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:38,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:42,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:46,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:51,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:55,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:03:59,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:03,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:07,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:11,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:15,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:19,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:23,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:27,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:31,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:35,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:39,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:43,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:47,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:52,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:04:56,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:00,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:04,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:08,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:12,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:16,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:20,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:24,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:28,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:32,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:36,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:41,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:45,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:49,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:53,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:05:57,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:01,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:05,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:09,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:13,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:17,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:22,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:26,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:30,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:34,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:38,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:43,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:47,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:51,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:56,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 22:06:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:06:57,021 INFO L93 Difference]: Finished difference Result 272 states and 345 transitions. [2024-09-12 22:06:57,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2024-09-12 22:06:57,021 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 2.058139534883721) internal successors, (177), 86 states have internal predecessors, (177), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2024-09-12 22:06:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:06:57,023 INFO L225 Difference]: With dead ends: 272 [2024-09-12 22:06:57,023 INFO L226 Difference]: Without dead ends: 247 [2024-09-12 22:06:57,026 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=5123, Invalid=12433, Unknown=0, NotChecked=0, Total=17556 [2024-09-12 22:06:57,027 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7437 mSolverCounterSat, 126 mSolverCounterUnsat, 84 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 338.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 7647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 7437 IncrementalHoareTripleChecker+Invalid, 84 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 339.4s IncrementalHoareTripleChecker+Time [2024-09-12 22:06:57,027 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 127 Invalid, 7647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 7437 Invalid, 84 Unknown, 0 Unchecked, 339.4s Time] [2024-09-12 22:06:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-09-12 22:06:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 175. [2024-09-12 22:06:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.111764705882353) internal successors, (189), 170 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:06:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2024-09-12 22:06:57,078 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 152 [2024-09-12 22:06:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:06:57,079 INFO L474 AbstractCegarLoop]: Abstraction has 175 states and 193 transitions. [2024-09-12 22:06:57,079 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 2.058139534883721) internal successors, (177), 86 states have internal predecessors, (177), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:06:57,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:06:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 193 transitions. [2024-09-12 22:06:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-09-12 22:06:57,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:06:57,082 INFO L216 NwaCegarLoop]: trace histogram [82, 64, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:06:57,100 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 22:06:57,282 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:06:57,283 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:06:57,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:06:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1252195224, now seen corresponding path program 7 times [2024-09-12 22:06:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:06:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290530060] [2024-09-12 22:06:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:06:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:06:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:07:00,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:07:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:07:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 2275 proven. 4160 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-09-12 22:07:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:07:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290530060] [2024-09-12 22:07:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290530060] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:07:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861256136] [2024-09-12 22:07:00,893 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 22:07:00,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:07:00,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:07:00,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 22:07:00,896 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 22:07:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:07:01,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-09-12 22:07:01,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:07:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 1512 proven. 5112 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-12 22:07:01,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:07:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 1512 proven. 5112 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-12 22:07:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861256136] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:07:13,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:07:13,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 74, 75] total 148 [2024-09-12 22:07:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095868174] [2024-09-12 22:07:13,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:07:13,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2024-09-12 22:07:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:07:13,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2024-09-12 22:07:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5688, Invalid=16068, Unknown=0, NotChecked=0, Total=21756 [2024-09-12 22:07:13,037 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand has 148 states, 148 states have (on average 2.027027027027027) internal successors, (300), 148 states have internal predecessors, (300), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:07:21,391 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< 99999999 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ 15 c_main_~x~0) 4294967296))) (or (< 99999999 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ 29 c_main_~x~0) 4294967296))) (or (< 99999999 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< 99999999 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ 33 c_main_~x~0) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (< 99999999 .cse7))) (let ((.cse8 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (< 99999999 .cse10))) (let ((.cse11 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (< 99999999 .cse13))) (let ((.cse14 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (< 99999999 .cse14))) (let ((.cse15 (mod (+ c_main_~x~0 24) 4294967296))) (or (< .cse15 10000000) (< 99999999 .cse15))) (let ((.cse16 (mod (+ 59 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (< 99999999 .cse16))) (let ((.cse17 (mod (+ 49 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (< 99999999 .cse17))) (let ((.cse18 (mod (+ 46 c_main_~x~0) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< 99999999 .cse19) (< .cse19 10000000))) (let ((.cse20 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (< 99999999 .cse20))) (let ((.cse21 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (< 99999999 .cse21))) (let ((.cse22 (mod (+ 47 c_main_~x~0) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (< 99999999 .cse23))) (let ((.cse24 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< 99999999 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ 20 c_main_~x~0) 4294967296))) (or (< 99999999 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ 35 c_main_~x~0) 4294967296))) (or (< 99999999 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (< 99999999 .cse28))) (let ((.cse29 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< 99999999 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 99999999 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse31 10000000) (< 99999999 .cse31))) (let ((.cse32 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse32) (< .cse32 10000000))) (let ((.cse33 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (< 99999999 .cse33))) (let ((.cse34 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse34 10000000) (< 99999999 .cse34))) (let ((.cse35 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ 66 c_main_~x~0) 4294967296))) (or (< 99999999 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse38) (< .cse38 10000000))) (let ((.cse39 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse39) (< .cse39 10000000))) (let ((.cse40 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (< 99999999 .cse40))) (let ((.cse41 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse41) (< .cse41 10000000))) (let ((.cse42 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse42 10000000) (< 99999999 .cse42))) (let ((.cse43 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (< 99999999 .cse43))) (let ((.cse44 (mod (+ 77 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (< 99999999 .cse44))) (let ((.cse45 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< 99999999 .cse45) (< .cse45 10000000))) (let ((.cse46 (mod (+ c_main_~x~0 54) 4294967296))) (or (< 99999999 .cse46) (< .cse46 10000000))) (let ((.cse47 (mod (+ 71 c_main_~x~0) 4294967296))) (or (< 99999999 .cse47) (< .cse47 10000000))) (let ((.cse48 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (< 99999999 .cse48))) (let ((.cse49 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (< 99999999 .cse49))) (let ((.cse50 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse50 10000000) (< 99999999 .cse50))) (let ((.cse51 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (< 99999999 .cse51))) (let ((.cse52 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse52 10000000) (< 99999999 .cse52))) (let ((.cse53 (mod (+ c_main_~x~0 27) 4294967296))) (or (< 99999999 .cse53) (< .cse53 10000000))) (let ((.cse54 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (< 99999999 .cse54))) (let ((.cse55 (mod (+ c_main_~x~0 37) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 70 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse57 10000000) (< 99999999 .cse57))) (let ((.cse58 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (< 99999999 .cse58))) (let ((.cse59 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (< 99999999 .cse59))) (let ((.cse60 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse60 10000000) (< 99999999 .cse60))) (let ((.cse61 (mod (+ 68 c_main_~x~0) 4294967296))) (or (< 99999999 .cse61) (< .cse61 10000000))) (let ((.cse62 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse62) (< .cse62 10000000))) (let ((.cse63 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse63) (< .cse63 10000000))) (let ((.cse64 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse64) (< .cse64 10000000))) (let ((.cse65 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< 99999999 .cse65) (< .cse65 10000000))) (let ((.cse66 (mod (+ 73 c_main_~x~0) 4294967296))) (or (< 99999999 .cse66) (< .cse66 10000000))) (let ((.cse67 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse67) (< .cse67 10000000))) (let ((.cse68 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse68) (< .cse68 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse69 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< 99999999 .cse69) (< .cse69 10000000))) (let ((.cse70 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< 99999999 .cse70) (< .cse70 10000000)))) is different from false [2024-09-12 22:07:25,429 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< 99999999 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ 15 c_main_~x~0) 4294967296))) (or (< 99999999 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ 29 c_main_~x~0) 4294967296))) (or (< 99999999 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< 99999999 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ 33 c_main_~x~0) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (< 99999999 .cse7))) (let ((.cse8 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (< 99999999 .cse10))) (let ((.cse11 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (< 99999999 .cse13))) (let ((.cse14 (mod (+ c_main_~x~0 24) 4294967296))) (or (< .cse14 10000000) (< 99999999 .cse14))) (let ((.cse15 (mod (+ 59 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (< 99999999 .cse15))) (let ((.cse16 (mod (+ 49 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (< 99999999 .cse16))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (< 99999999 .cse17) (< .cse17 10000000))) (let ((.cse18 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (< 99999999 .cse19))) (let ((.cse20 (mod (+ 47 c_main_~x~0) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ 42 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (< 99999999 .cse21))) (let ((.cse22 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ 20 c_main_~x~0) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ 35 c_main_~x~0) 4294967296))) (or (< 99999999 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse25 10000000) (< 99999999 .cse25))) (let ((.cse26 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse27 10000000) (< 99999999 .cse27))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse30 10000000) (< 99999999 .cse30))) (let ((.cse31 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse32) (< .cse32 10000000))) (let ((.cse33 (mod (+ 66 c_main_~x~0) 4294967296))) (or (< 99999999 .cse33) (< .cse33 10000000))) (let ((.cse34 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse36 10000000) (< 99999999 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (< 99999999 .cse38))) (let ((.cse39 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse39 10000000) (< 99999999 .cse39))) (let ((.cse40 (mod (+ 77 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (< 99999999 .cse40))) (let ((.cse41 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< 99999999 .cse41) (< .cse41 10000000))) (let ((.cse42 (mod (+ c_main_~x~0 54) 4294967296))) (or (< 99999999 .cse42) (< .cse42 10000000))) (let ((.cse43 (mod (+ 71 c_main_~x~0) 4294967296))) (or (< 99999999 .cse43) (< .cse43 10000000))) (let ((.cse44 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (< 99999999 .cse44))) (let ((.cse45 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (< 99999999 .cse45))) (let ((.cse46 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (< 99999999 .cse46))) (let ((.cse47 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (< 99999999 .cse47))) (let ((.cse48 (mod (+ c_main_~x~0 27) 4294967296))) (or (< 99999999 .cse48) (< .cse48 10000000))) (let ((.cse49 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (< 99999999 .cse49))) (let ((.cse50 (mod (+ c_main_~x~0 37) 4294967296))) (or (< 99999999 .cse50) (< .cse50 10000000))) (let ((.cse51 (mod (+ 70 c_main_~x~0) 4294967296))) (or (< 99999999 .cse51) (< .cse51 10000000))) (let ((.cse52 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse52 10000000) (< 99999999 .cse52))) (let ((.cse53 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (< 99999999 .cse53))) (let ((.cse54 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (< 99999999 .cse54))) (let ((.cse55 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (< 99999999 .cse55))) (let ((.cse56 (mod (+ 68 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse57) (< .cse57 10000000))) (let ((.cse58 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse58) (< .cse58 10000000))) (let ((.cse59 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse59) (< .cse59 10000000))) (let ((.cse60 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< 99999999 .cse60) (< .cse60 10000000))) (let ((.cse61 (mod (+ 73 c_main_~x~0) 4294967296))) (or (< 99999999 .cse61) (< .cse61 10000000))) (let ((.cse62 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse62) (< .cse62 10000000))) (let ((.cse63 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse63) (< .cse63 10000000)))) is different from false [2024-09-12 22:07:29,447 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< 99999999 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ 15 c_main_~x~0) 4294967296))) (or (< 99999999 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ 29 c_main_~x~0) 4294967296))) (or (< 99999999 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< 99999999 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ 33 c_main_~x~0) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (< 99999999 .cse7))) (let ((.cse8 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (< 99999999 .cse10))) (let ((.cse11 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (< 99999999 .cse13))) (let ((.cse14 (mod (+ c_main_~x~0 24) 4294967296))) (or (< .cse14 10000000) (< 99999999 .cse14))) (let ((.cse15 (mod (+ 59 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (< 99999999 .cse15))) (let ((.cse16 (mod (+ 49 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (< 99999999 .cse16))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (< 99999999 .cse17) (< .cse17 10000000))) (let ((.cse18 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (< 99999999 .cse19))) (let ((.cse20 (mod (+ 47 c_main_~x~0) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ 42 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (< 99999999 .cse21))) (let ((.cse22 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ 20 c_main_~x~0) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ 35 c_main_~x~0) 4294967296))) (or (< 99999999 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse25 10000000) (< 99999999 .cse25))) (let ((.cse26 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse27 10000000) (< 99999999 .cse27))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse30 10000000) (< 99999999 .cse30))) (let ((.cse31 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse32) (< .cse32 10000000))) (let ((.cse33 (mod (+ 66 c_main_~x~0) 4294967296))) (or (< 99999999 .cse33) (< .cse33 10000000))) (let ((.cse34 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse36 10000000) (< 99999999 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (< 99999999 .cse38))) (let ((.cse39 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse39 10000000) (< 99999999 .cse39))) (let ((.cse40 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< 99999999 .cse40) (< .cse40 10000000))) (let ((.cse41 (mod (+ c_main_~x~0 54) 4294967296))) (or (< 99999999 .cse41) (< .cse41 10000000))) (let ((.cse42 (mod (+ 71 c_main_~x~0) 4294967296))) (or (< 99999999 .cse42) (< .cse42 10000000))) (let ((.cse43 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (< 99999999 .cse43))) (let ((.cse44 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (< 99999999 .cse44))) (let ((.cse45 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (< 99999999 .cse45))) (let ((.cse46 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (< 99999999 .cse46))) (let ((.cse47 (mod (+ c_main_~x~0 27) 4294967296))) (or (< 99999999 .cse47) (< .cse47 10000000))) (let ((.cse48 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (< 99999999 .cse48))) (let ((.cse49 (mod (+ c_main_~x~0 37) 4294967296))) (or (< 99999999 .cse49) (< .cse49 10000000))) (let ((.cse50 (mod (+ 70 c_main_~x~0) 4294967296))) (or (< 99999999 .cse50) (< .cse50 10000000))) (let ((.cse51 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse51 10000000) (< 99999999 .cse51))) (let ((.cse52 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse52 10000000) (< 99999999 .cse52))) (let ((.cse53 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (< 99999999 .cse53))) (let ((.cse54 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (< 99999999 .cse54))) (let ((.cse55 (mod (+ 68 c_main_~x~0) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse57) (< .cse57 10000000))) (let ((.cse58 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse58) (< .cse58 10000000))) (let ((.cse59 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< 99999999 .cse59) (< .cse59 10000000))) (let ((.cse60 (mod (+ 73 c_main_~x~0) 4294967296))) (or (< 99999999 .cse60) (< .cse60 10000000))) (let ((.cse61 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse61) (< .cse61 10000000))) (let ((.cse62 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse62) (< .cse62 10000000)))) is different from false [2024-09-12 22:07:33,523 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (< 99999999 .cse0))) (let ((.cse1 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< 99999999 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ 15 c_main_~x~0) 4294967296))) (or (< 99999999 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ 29 c_main_~x~0) 4294967296))) (or (< 99999999 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (< 99999999 .cse4))) (let ((.cse5 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< 99999999 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ 33 c_main_~x~0) 4294967296))) (or (< 99999999 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (< 99999999 .cse7))) (let ((.cse8 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (< 99999999 .cse10))) (let ((.cse11 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (< 99999999 .cse13))) (let ((.cse14 (mod (+ c_main_~x~0 24) 4294967296))) (or (< .cse14 10000000) (< 99999999 .cse14))) (let ((.cse15 (mod (+ 59 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (< 99999999 .cse15))) (let ((.cse16 (mod (+ 49 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (< 99999999 .cse16))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (< 99999999 .cse17) (< .cse17 10000000))) (let ((.cse18 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< 99999999 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse19 10000000) (< 99999999 .cse19))) (let ((.cse20 (mod (+ 47 c_main_~x~0) 4294967296))) (or (< 99999999 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ 42 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (< 99999999 .cse21))) (let ((.cse22 (mod (+ 20 c_main_~x~0) 4294967296))) (or (< 99999999 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ 35 c_main_~x~0) 4294967296))) (or (< 99999999 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (let ((.cse25 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 99999999 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse26 10000000) (< 99999999 .cse26))) (let ((.cse27 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (< 99999999 .cse28))) (let ((.cse29 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (< 99999999 .cse29))) (let ((.cse30 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< 99999999 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ 66 c_main_~x~0) 4294967296))) (or (< 99999999 .cse32) (< .cse32 10000000))) (let ((.cse33 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse33) (< .cse33 10000000))) (let ((.cse34 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (< 99999999 .cse35))) (let ((.cse36 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse37 10000000) (< 99999999 .cse37))) (let ((.cse38 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (< 99999999 .cse38))) (let ((.cse39 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< 99999999 .cse39) (< .cse39 10000000))) (let ((.cse40 (mod (+ c_main_~x~0 54) 4294967296))) (or (< 99999999 .cse40) (< .cse40 10000000))) (let ((.cse41 (mod (+ 71 c_main_~x~0) 4294967296))) (or (< 99999999 .cse41) (< .cse41 10000000))) (let ((.cse42 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse42 10000000) (< 99999999 .cse42))) (let ((.cse43 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (< 99999999 .cse43))) (let ((.cse44 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (< 99999999 .cse44))) (let ((.cse45 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (< 99999999 .cse45))) (let ((.cse46 (mod (+ c_main_~x~0 27) 4294967296))) (or (< 99999999 .cse46) (< .cse46 10000000))) (let ((.cse47 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (< 99999999 .cse47))) (let ((.cse48 (mod (+ c_main_~x~0 37) 4294967296))) (or (< 99999999 .cse48) (< .cse48 10000000))) (let ((.cse49 (mod (+ 70 c_main_~x~0) 4294967296))) (or (< 99999999 .cse49) (< .cse49 10000000))) (let ((.cse50 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse50 10000000) (< 99999999 .cse50))) (let ((.cse51 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (< 99999999 .cse51))) (let ((.cse52 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse52 10000000) (< 99999999 .cse52))) (let ((.cse53 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (< 99999999 .cse53))) (let ((.cse54 (mod (+ 68 c_main_~x~0) 4294967296))) (or (< 99999999 .cse54) (< .cse54 10000000))) (let ((.cse55 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse57) (< .cse57 10000000))) (let ((.cse58 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< 99999999 .cse58) (< .cse58 10000000))) (let ((.cse59 (mod (+ 73 c_main_~x~0) 4294967296))) (or (< 99999999 .cse59) (< .cse59 10000000))) (let ((.cse60 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse60) (< .cse60 10000000))) (let ((.cse61 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse61) (< .cse61 10000000)))) is different from false Killed by 15