./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.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/mono-crafted_11.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 c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 --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 22:14:24,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 22:14:24,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 22:14:24,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 22:14:24,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 22:14:24,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 22:14:24,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 22:14:24,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 22:14:24,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 22:14:24,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 22:14:24,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 22:14:24,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 22:14:24,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 22:14:24,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 22:14:24,572 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 22:14:24,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 22:14:24,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 22:14:24,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 22:14:24,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 22:14:24,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 22:14:24,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 22:14:24,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 22:14:24,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 22:14:24,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 22:14:24,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 22:14:24,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 22:14:24,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 22:14:24,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 22:14:24,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 22:14:24,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 22:14:24,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 22:14:24,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 22:14:24,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:14:24,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 22:14:24,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 22:14:24,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 22:14:24,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 22:14:24,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 22:14:24,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 22:14:24,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 22:14:24,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 22:14:24,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 22:14:24,582 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 -> c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 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 22:14:24,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 22:14:24,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 22:14:24,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 22:14:24,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 22:14:24,884 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 22:14:24,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2024-09-12 22:14:26,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 22:14:26,468 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 22:14:26,469 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2024-09-12 22:14:26,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c57c3136a/fce9a2ee85c4422c856f3e68138ef2ff/FLAG009edbbb6 [2024-09-12 22:14:26,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c57c3136a/fce9a2ee85c4422c856f3e68138ef2ff [2024-09-12 22:14:26,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 22:14:26,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 22:14:26,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 22:14:26,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 22:14:26,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 22:14:26,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5503cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26, skipping insertion in model container [2024-09-12 22:14:26,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 22:14:26,671 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/mono-crafted_11.c[319,332] [2024-09-12 22:14:26,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:14:26,692 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 22:14:26,703 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/mono-crafted_11.c[319,332] [2024-09-12 22:14:26,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:14:26,720 INFO L204 MainTranslator]: Completed translation [2024-09-12 22:14:26,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26 WrapperNode [2024-09-12 22:14:26,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 22:14:26,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 22:14:26,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 22:14:26,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 22:14:26,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,737 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 22:14:26,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 22:14:26,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 22:14:26,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 22:14:26,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 22:14:26,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,756 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 22:14:26,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 22:14:26,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 22:14:26,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 22:14:26,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 22:14:26,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (1/1) ... [2024-09-12 22:14:26,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:14:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:26,792 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 22:14:26,794 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 22:14:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 22:14:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 22:14:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 22:14:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 22:14:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 22:14:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 22:14:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 22:14:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 22:14:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 22:14:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 22:14:26,876 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 22:14:26,878 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 22:14:26,967 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-12 22:14:26,967 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 22:14:26,983 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 22:14:26,983 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 22:14:26,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:14:26 BoogieIcfgContainer [2024-09-12 22:14:26,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 22:14:26,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 22:14:26,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 22:14:26,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 22:14:26,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 10:14:26" (1/3) ... [2024-09-12 22:14:26,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d919c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:14:26, skipping insertion in model container [2024-09-12 22:14:26,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:14:26" (2/3) ... [2024-09-12 22:14:26,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d919c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:14:26, skipping insertion in model container [2024-09-12 22:14:26,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:14:26" (3/3) ... [2024-09-12 22:14:26,991 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2024-09-12 22:14:27,002 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 22:14:27,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 22:14:27,067 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 22:14:27,075 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;@6c37b5b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 22:14:27,075 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 22:14:27,079 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 22:14:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 22:14:27,086 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:27,086 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:27,087 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:27,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:27,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1957128844, now seen corresponding path program 1 times [2024-09-12 22:14:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707595830] [2024-09-12 22:14:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,234 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,245 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 22:14:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707595830] [2024-09-12 22:14:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707595830] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:14:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:14:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 22:14:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933149375] [2024-09-12 22:14:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:14:27,252 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 22:14:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:27,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 22:14:27,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 22:14:27,272 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 22:14:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:27,297 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 22:14:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 22:14:27,305 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 22:14:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:27,311 INFO L225 Difference]: With dead ends: 29 [2024-09-12 22:14:27,311 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 22:14:27,313 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 22:14:27,315 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 22:14:27,316 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 22:14:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 22:14:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 22:14:27,337 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 22:14:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 22:14:27,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 22:14:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:27,339 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 22:14:27,339 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 22:14:27,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 22:14:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 22:14:27,340 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:27,341 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:27,341 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 22:14:27,341 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:27,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1947893634, now seen corresponding path program 1 times [2024-09-12 22:14:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:27,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074401736] [2024-09-12 22:14:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:27,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,463 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 22:14:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074401736] [2024-09-12 22:14:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074401736] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:14:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:14:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 22:14:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173823843] [2024-09-12 22:14:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:14:27,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 22:14:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:27,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 22:14:27,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 22:14:27,467 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 22:14:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:27,491 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-12 22:14:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 22:14:27,492 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 22:14:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:27,493 INFO L225 Difference]: With dead ends: 21 [2024-09-12 22:14:27,493 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 22:14:27,494 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 22:14:27,495 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 22:14:27,495 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 22:14:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 22:14:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-12 22:14:27,503 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 22:14:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-09-12 22:14:27,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-09-12 22:14:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:27,507 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-09-12 22:14:27,507 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 22:14:27,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-09-12 22:14:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 22:14:27,508 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:27,509 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:27,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 22:14:27,510 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:27,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 365820639, now seen corresponding path program 1 times [2024-09-12 22:14:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279941407] [2024-09-12 22:14:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,665 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 22:14:27,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279941407] [2024-09-12 22:14:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279941407] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:14:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743433649] [2024-09-12 22:14:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:27,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:14:27,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:27,668 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 22:14:27,670 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 22:14:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:27,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 22:14:27,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:14:27,774 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 22:14:27,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:14:27,824 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 22:14:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743433649] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:14:27,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:14:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 22:14:27,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855453352] [2024-09-12 22:14:27,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:14:27,827 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 22:14:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 22:14:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-12 22:14:27,829 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:14:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:27,883 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-12 22:14:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 22:14:27,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 12 [2024-09-12 22:14:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:27,886 INFO L225 Difference]: With dead ends: 25 [2024-09-12 22:14:27,886 INFO L226 Difference]: Without dead ends: 18 [2024-09-12 22:14:27,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-12 22:14:27,887 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 22:14:27,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 22:14:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-12 22:14:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-09-12 22:14:27,894 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 22:14:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-12 22:14:27,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-09-12 22:14:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:27,896 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-12 22:14:27,896 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:14:27,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-12 22:14:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 22:14:27,898 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:27,898 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:27,911 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 22:14:28,099 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 22:14:28,099 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:28,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1989560599, now seen corresponding path program 1 times [2024-09-12 22:14:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:28,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251266186] [2024-09-12 22:14:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:28,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:28,231 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 22:14:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251266186] [2024-09-12 22:14:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251266186] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:14:28,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146437011] [2024-09-12 22:14:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:28,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:14:28,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:28,241 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 22:14:28,244 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 22:14:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:28,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 22:14:28,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:14:28,362 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 22:14:28,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:14:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 22:14:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146437011] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:14:28,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:14:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-09-12 22:14:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267600338] [2024-09-12 22:14:28,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:14:28,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 22:14:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 22:14:28,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-12 22:14:28,454 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:14:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:28,545 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-09-12 22:14:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 22:14:28,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 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 22:14:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:28,546 INFO L225 Difference]: With dead ends: 33 [2024-09-12 22:14:28,546 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 22:14:28,547 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-12 22:14:28,550 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 22:14:28,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 22:14:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 22:14:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-09-12 22:14:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:14:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-09-12 22:14:28,562 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2024-09-12 22:14:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:28,563 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-09-12 22:14:28,563 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 22:14:28,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-09-12 22:14:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 22:14:28,564 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:28,564 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:28,578 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 22:14:28,768 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 22:14:28,769 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:28,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1675294028, now seen corresponding path program 2 times [2024-09-12 22:14:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886858870] [2024-09-12 22:14:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:28,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 22:14:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886858870] [2024-09-12 22:14:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886858870] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:14:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212709938] [2024-09-12 22:14:28,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 22:14:28,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:14:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:28,944 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 22:14:28,948 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 22:14:28,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 22:14:28,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:14:28,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 22:14:28,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:14:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 22:14:29,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:14:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 22:14:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212709938] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:14:29,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:14:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-09-12 22:14:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147879300] [2024-09-12 22:14:29,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:14:29,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 22:14:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:29,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 22:14:29,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-09-12 22:14:29,151 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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:14:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:29,392 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-12 22:14:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 22:14:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 18 [2024-09-12 22:14:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:29,394 INFO L225 Difference]: With dead ends: 41 [2024-09-12 22:14:29,395 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 22:14:29,395 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2024-09-12 22:14:29,396 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 22:14:29,397 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 22:14:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 22:14:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-12 22:14:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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:14:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-09-12 22:14:29,411 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 18 [2024-09-12 22:14:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:29,411 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-09-12 22:14:29,411 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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:14:29,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-09-12 22:14:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 22:14:29,413 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:29,413 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:29,430 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 22:14:29,617 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 22:14:29,618 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:29,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1980100574, now seen corresponding path program 3 times [2024-09-12 22:14:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916044023] [2024-09-12 22:14:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:29,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 22:14:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916044023] [2024-09-12 22:14:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916044023] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:14:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742760880] [2024-09-12 22:14:29,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 22:14:29,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:14:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:29,901 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 22:14:29,903 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 22:14:29,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 22:14:29,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:14:29,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 22:14:29,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:14:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-12 22:14:30,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:14:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-12 22:14:30,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742760880] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:14:30,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:14:30,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-09-12 22:14:30,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386619203] [2024-09-12 22:14:30,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:14:30,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 22:14:30,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 22:14:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-09-12 22:14:30,062 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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:14:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:30,273 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-12 22:14:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 22:14:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 30 [2024-09-12 22:14:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:30,274 INFO L225 Difference]: With dead ends: 62 [2024-09-12 22:14:30,276 INFO L226 Difference]: Without dead ends: 52 [2024-09-12 22:14:30,276 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-09-12 22:14:30,277 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 22:14:30,278 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 22:14:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-12 22:14:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2024-09-12 22:14:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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:14:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-12 22:14:30,300 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2024-09-12 22:14:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:30,301 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-12 22:14:30,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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:14:30,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-12 22:14:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 22:14:30,303 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:30,303 INFO L216 NwaCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:30,320 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 22:14:30,507 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 22:14:30,508 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:30,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash -600183635, now seen corresponding path program 4 times [2024-09-12 22:14:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039956743] [2024-09-12 22:14:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:30,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 22:14:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039956743] [2024-09-12 22:14:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039956743] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:14:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341869696] [2024-09-12 22:14:30,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 22:14:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:14:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:30,852 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 22:14:30,853 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 22:14:30,898 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 22:14:30,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:14:30,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-12 22:14:30,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:14:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 22:14:30,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:14:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 22:14:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341869696] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:14:31,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:14:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 32 [2024-09-12 22:14:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641026656] [2024-09-12 22:14:31,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:14:31,666 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-12 22:14:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-12 22:14:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2024-09-12 22:14:31,667 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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:14:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:14:42,515 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2024-09-12 22:14:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 22:14:42,515 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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 40 [2024-09-12 22:14:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:14:42,517 INFO L225 Difference]: With dead ends: 89 [2024-09-12 22:14:42,517 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 22:14:42,518 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=747, Invalid=1323, Unknown=0, NotChecked=0, Total=2070 [2024-09-12 22:14:42,519 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 22:14:42,519 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 22:14:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 22:14:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-12 22:14:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 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:14:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-09-12 22:14:42,554 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 40 [2024-09-12 22:14:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:14:42,554 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-09-12 22:14:42,555 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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:14:42,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-09-12 22:14:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 22:14:42,556 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:14:42,556 INFO L216 NwaCegarLoop]: trace histogram [31, 27, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:14:42,573 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 22:14:42,760 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 22:14:42,761 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:14:42,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:14:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1482199165, now seen corresponding path program 5 times [2024-09-12 22:14:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:14:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362124580] [2024-09-12 22:14:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:14:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:14:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:43,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:14:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:14:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 196 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 22:14:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:14:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362124580] [2024-09-12 22:14:43,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362124580] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:14:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843704881] [2024-09-12 22:14:43,577 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 22:14:43,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:14:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:14:43,579 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 22:14:43,584 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 22:14:43,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-09-12 22:14:43,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:14:43,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-09-12 22:14:43,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:14:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 145 proven. 812 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 22:14:43,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:14:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 145 proven. 812 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 22:14:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843704881] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:14:45,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:14:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 32] total 62 [2024-09-12 22:14:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775582103] [2024-09-12 22:14:45,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:14:45,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-09-12 22:14:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:14:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-09-12 22:14:45,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2732, Unknown=0, NotChecked=0, Total=3782 [2024-09-12 22:14:45,612 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 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:15:08,696 WARN L293 SmtUtils]: Spent 8.73s 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 22:15:29,429 WARN L293 SmtUtils]: Spent 7.20s 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 22:15:48,102 WARN L293 SmtUtils]: Spent 7.19s 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 22:16:05,321 WARN L293 SmtUtils]: Spent 6.48s 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 22:16:22,388 WARN L293 SmtUtils]: Spent 6.56s 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:18:50,920 WARN L293 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 177 DAG size of output: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 22:18:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:18:50,923 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-09-12 22:18:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-12 22:18:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 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 72 [2024-09-12 22:18:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:18:50,924 INFO L225 Difference]: With dead ends: 151 [2024-09-12 22:18:50,925 INFO L226 Difference]: Without dead ends: 135 [2024-09-12 22:18:50,926 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 246.2s TimeCoverageRelationStatistics Valid=2848, Invalid=5342, Unknown=0, NotChecked=0, Total=8190 [2024-09-12 22:18:50,927 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 22:18:50,927 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 22:18:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-12 22:18:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-09-12 22:18:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 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:18:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2024-09-12 22:18:50,960 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 72 [2024-09-12 22:18:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:18:50,961 INFO L474 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2024-09-12 22:18:50,961 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 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:18:50,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:18:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2024-09-12 22:18:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-12 22:18:50,965 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:18:50,965 INFO L216 NwaCegarLoop]: trace histogram [61, 57, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:18:50,979 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:18:51,165 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:18:51,166 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:18:51,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:18:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash 659915043, now seen corresponding path program 6 times [2024-09-12 22:18:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:18:51,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082797798] [2024-09-12 22:18:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:18:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:18:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:18:53,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:18:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:18:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 406 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 22:18:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:18:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082797798] [2024-09-12 22:18:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082797798] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:18:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818951771] [2024-09-12 22:18:53,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 22:18:53,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:18:53,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:18:53,474 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:18:53,477 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:18:53,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-09-12 22:18:53,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 22:18:53,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 22:18:53,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:18:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 513 proven. 16 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2024-09-12 22:18:53,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:18:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 513 proven. 14 refuted. 2 times theorem prover too weak. 3192 trivial. 0 not checked. [2024-09-12 22:18:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818951771] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:18:58,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:18:58,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 8] total 71 [2024-09-12 22:18:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637437437] [2024-09-12 22:18:58,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:18:58,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-09-12 22:18:58,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:18:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-09-12 22:18:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=4182, Unknown=1, NotChecked=0, Total=4970 [2024-09-12 22:18:58,269 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 states have internal predecessors, (147), 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:19:17,219 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:19:21,222 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:19:25,225 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:19:29,393 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:19:33,396 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:19:37,476 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:19:41,480 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:19:45,687 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:19:49,697 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:19:53,809 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:19:57,964 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:20:01,971 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:20:05,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:20:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:20:05,980 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2024-09-12 22:20:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-09-12 22:20:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 states have internal predecessors, (147), 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 132 [2024-09-12 22:20:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:20:05,987 INFO L225 Difference]: With dead ends: 220 [2024-09-12 22:20:05,987 INFO L226 Difference]: Without dead ends: 204 [2024-09-12 22:20:05,988 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1601, Invalid=5538, Unknown=1, NotChecked=0, Total=7140 [2024-09-12 22:20:05,989 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6195 mSolverCounterSat, 26 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 6234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6195 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.2s IncrementalHoareTripleChecker+Time [2024-09-12 22:20:05,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 6234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6195 Invalid, 13 Unknown, 0 Unchecked, 54.2s Time] [2024-09-12 22:20:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-09-12 22:20:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2024-09-12 22:20:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.1421052631578947) internal successors, (217), 190 states have internal predecessors, (217), 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:20:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2024-09-12 22:20:06,052 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 132 [2024-09-12 22:20:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:20:06,052 INFO L474 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2024-09-12 22:20:06,052 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 states have internal predecessors, (147), 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:20:06,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:20:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2024-09-12 22:20:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-09-12 22:20:06,055 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:20:06,055 INFO L216 NwaCegarLoop]: trace histogram [69, 59, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 22:20:06,072 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 22:20:06,255 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:20:06,256 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:20:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:20:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2007949823, now seen corresponding path program 7 times [2024-09-12 22:20:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:20:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389520509] [2024-09-12 22:20:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:20:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:20:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:20:08,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:20:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:20:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 1140 proven. 3540 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-09-12 22:20:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:20:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389520509] [2024-09-12 22:20:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389520509] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:20:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130917413] [2024-09-12 22:20:08,840 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 22:20:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 22:20:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:20:08,842 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:20:08,843 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:20:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:20:08,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-09-12 22:20:08,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:20:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 1037 proven. 3660 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-12 22:20:09,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:20:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 1037 proven. 3660 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-12 22:20:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130917413] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:20:16,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 22:20:16,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 63, 64] total 126 [2024-09-12 22:20:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772849802] [2024-09-12 22:20:16,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 22:20:16,759 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2024-09-12 22:20:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:20:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2024-09-12 22:20:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4154, Invalid=11596, Unknown=0, NotChecked=0, Total=15750 [2024-09-12 22:20:16,764 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand has 126 states, 126 states have (on average 2.0317460317460316) internal successors, (256), 126 states have internal predecessors, (256), 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:20:23,890 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 7 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 (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (< 99999999 .cse8))) (let ((.cse9 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 9 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 5 c_main_~x~0) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ 52 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 (+ 3 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (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 (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ 13 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 (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (< 99999999 .cse38))) (let ((.cse39 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse39) (< .cse39 10000000))) (let ((.cse40 (mod (+ 39 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 (+ 10 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (< 99999999 .cse43))) (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 (+ c_main_~x~0 11) 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 (+ 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 (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse53) (< .cse53 10000000))) (let ((.cse54 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse54) (< .cse54 10000000))) (let ((.cse55 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse57) (< .cse57 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse58 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< 99999999 .cse58) (< .cse58 10000000))) (let ((.cse59 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< 99999999 .cse59) (< .cse59 10000000)))) is different from false [2024-09-12 22:20:27,935 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 7 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 (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (< 99999999 .cse8))) (let ((.cse9 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 9 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 5 c_main_~x~0) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ 52 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 (+ 3 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (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 (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ 13 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 (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (< 99999999 .cse38))) (let ((.cse39 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse39) (< .cse39 10000000))) (let ((.cse40 (mod (+ 39 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 (+ 10 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (< 99999999 .cse43))) (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 (+ c_main_~x~0 11) 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 (+ 18 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (< 99999999 .cse51))) (let ((.cse52 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse52) (< .cse52 10000000))) (let ((.cse53 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse53) (< .cse53 10000000))) (let ((.cse54 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse54) (< .cse54 10000000))) (let ((.cse55 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< 99999999 .cse57) (< .cse57 10000000))) (let ((.cse58 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< 99999999 .cse58) (< .cse58 10000000)))) is different from false [2024-09-12 22:20:31,954 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 7 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 (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (< 99999999 .cse8))) (let ((.cse9 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 9 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 5 c_main_~x~0) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ 52 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 (+ 3 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (< 99999999 .cse24))) (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 (+ 12 c_main_~x~0) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 99999999 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (< 99999999 .cse31))) (let ((.cse32 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (< 99999999 .cse33))) (let ((.cse34 (mod (+ 34 c_main_~x~0) 4294967296))) (or (< 99999999 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 99999999 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ 31 c_main_~x~0) 4294967296))) (or (< 99999999 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse37 10000000) (< 99999999 .cse37))) (let ((.cse38 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 99999999 .cse38) (< .cse38 10000000))) (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 (+ 10 c_main_~x~0) 4294967296))) (or (< .cse42 10000000) (< 99999999 .cse42))) (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 (+ c_main_~x~0 11) 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 (+ 18 c_main_~x~0) 4294967296))) (or (< .cse50 10000000) (< 99999999 .cse50))) (let ((.cse51 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse51) (< .cse51 10000000))) (let ((.cse52 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse52) (< .cse52 10000000))) (let ((.cse53 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse53) (< .cse53 10000000))) (let ((.cse54 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse54) (< .cse54 10000000))) (let ((.cse55 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000))) (let ((.cse57 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< 99999999 .cse57) (< .cse57 10000000)))) is different from false [2024-09-12 22:20:36,007 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 7 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 (+ 16 c_main_~x~0) 4294967296))) (or (< 99999999 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (< 99999999 .cse8))) (let ((.cse9 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (< 99999999 .cse9))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (< 99999999 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 99999999 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ 9 c_main_~x~0) 4294967296))) (or (< 99999999 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ 5 c_main_~x~0) 4294967296))) (or (< 99999999 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ 52 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 (+ 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 (+ 6 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (< 99999999 .cse20))) (let ((.cse21 (mod (+ 47 c_main_~x~0) 4294967296))) (or (< 99999999 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ 42 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (< 99999999 .cse22))) (let ((.cse23 (mod (+ 3 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (< 99999999 .cse23))) (let ((.cse24 (mod (+ 20 c_main_~x~0) 4294967296))) (or (< 99999999 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< 99999999 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ 35 c_main_~x~0) 4294967296))) (or (< 99999999 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< 99999999 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 99999999 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 99999999 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse30 10000000) (< 99999999 .cse30))) (let ((.cse31 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (< 99999999 .cse31))) (let ((.cse32 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (< 99999999 .cse32))) (let ((.cse33 (mod (+ 34 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 (+ 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 (+ 10 c_main_~x~0) 4294967296))) (or (< .cse41 10000000) (< 99999999 .cse41))) (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 (+ c_main_~x~0 11) 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 (+ 18 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (< 99999999 .cse49))) (let ((.cse50 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 99999999 .cse50) (< .cse50 10000000))) (let ((.cse51 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 99999999 .cse51) (< .cse51 10000000))) (let ((.cse52 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 99999999 .cse52) (< .cse52 10000000))) (let ((.cse53 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 99999999 .cse53) (< .cse53 10000000))) (let ((.cse54 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< 99999999 .cse54) (< .cse54 10000000))) (let ((.cse55 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< 99999999 .cse55) (< .cse55 10000000))) (let ((.cse56 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< 99999999 .cse56) (< .cse56 10000000)))) is different from false [2024-09-12 22:24:54,426 WARN L293 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 341 DAG size of output: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15