./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c --full-output --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 a9b967e5 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/nla-digbench-scaling/geo1-ll_unwindbound20.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 41de47755c46f2f4de69961f8458c254f5c62632809005d7de26bd26c8032b2a --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-a9b967e-m [2024-09-11 19:59:13,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:59:13,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:59:13,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:59:13,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:59:13,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:59:13,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:59:13,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:59:13,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:59:13,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:59:13,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:59:13,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:59:13,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:59:13,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:59:13,139 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:59:13,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:59:13,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:59:13,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:59:13,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:59:13,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:59:13,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:59:13,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:59:13,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:59:13,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:59:13,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:59:13,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:59:13,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:59:13,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:59:13,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:59:13,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:59:13,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:59:13,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:59:13,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:59:13,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:59:13,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:59:13,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:59:13,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:59:13,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:59:13,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:59:13,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:59:13,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:59:13,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:59:13,152 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 -> 41de47755c46f2f4de69961f8458c254f5c62632809005d7de26bd26c8032b2a 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-11 19:59:13,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:59:13,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:59:13,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:59:13,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:59:13,411 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:59:13,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c [2024-09-11 19:59:14,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:59:15,035 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:59:15,036 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c [2024-09-11 19:59:15,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4d66b9285/d499bb78deea49caa9b62ecab44de601/FLAG01dca2712 [2024-09-11 19:59:15,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4d66b9285/d499bb78deea49caa9b62ecab44de601 [2024-09-11 19:59:15,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:59:15,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:59:15,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:59:15,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:59:15,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:59:15,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c02525a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15, skipping insertion in model container [2024-09-11 19:59:15,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:59:15,620 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/nla-digbench-scaling/geo1-ll_unwindbound20.c[546,559] [2024-09-11 19:59:15,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:59:15,647 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:59:15,658 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/nla-digbench-scaling/geo1-ll_unwindbound20.c[546,559] [2024-09-11 19:59:15,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:59:15,676 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:59:15,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15 WrapperNode [2024-09-11 19:59:15,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:59:15,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:59:15,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:59:15,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:59:15,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,710 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-09-11 19:59:15,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:59:15,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:59:15,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:59:15,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:59:15,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,732 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-11 19:59:15,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:59:15,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:59:15,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:59:15,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:59:15,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (1/1) ... [2024-09-11 19:59:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:59:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:59:15,779 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-11 19:59:15,783 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-11 19:59:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:59:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:59:15,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:59:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:59:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:59:15,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:59:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:59:15,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:59:15,888 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:59:15,890 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:59:16,017 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-11 19:59:16,017 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:59:16,043 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:59:16,043 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 19:59:16,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:59:16 BoogieIcfgContainer [2024-09-11 19:59:16,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:59:16,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:59:16,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:59:16,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:59:16,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:59:15" (1/3) ... [2024-09-11 19:59:16,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa3a07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:59:16, skipping insertion in model container [2024-09-11 19:59:16,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:59:15" (2/3) ... [2024-09-11 19:59:16,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa3a07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:59:16, skipping insertion in model container [2024-09-11 19:59:16,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:59:16" (3/3) ... [2024-09-11 19:59:16,052 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound20.c [2024-09-11 19:59:16,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:59:16,069 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:59:16,193 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:59:16,199 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;@11ad0f6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:59:16,199 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:59:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:59:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:59:16,209 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:59:16,210 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:59:16,210 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:59:16,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash -439153478, now seen corresponding path program 1 times [2024-09-11 19:59:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:59:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969249126] [2024-09-11 19:59:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:59:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:16,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:59:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:16,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:59:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:59:16,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:59:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969249126] [2024-09-11 19:59:16,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969249126] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:59:16,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:59:16,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:59:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136851296] [2024-09-11 19:59:16,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:59:16,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:59:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:59:16,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:59:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:59:16,431 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:59:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:59:16,453 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-09-11 19:59:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:59:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-11 19:59:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:59:16,461 INFO L225 Difference]: With dead ends: 42 [2024-09-11 19:59:16,461 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 19:59:16,464 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-11 19:59:16,467 INFO L434 NwaCegarLoop]: 23 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, 23 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-11 19:59:16,468 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:59:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 19:59:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-11 19:59:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 19:59:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-09-11 19:59:16,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2024-09-11 19:59:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:59:16,499 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-09-11 19:59:16,499 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:59:16,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-09-11 19:59:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:59:16,502 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:59:16,502 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:59:16,502 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:59:16,502 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:59:16,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1801449375, now seen corresponding path program 1 times [2024-09-11 19:59:16,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:59:16,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624258912] [2024-09-11 19:59:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:59:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:59:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482396753] [2024-09-11 19:59:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:16,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:59:16,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:59:16,563 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-11 19:59:16,564 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-11 19:59:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:16,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:59:16,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:59:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:59:16,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:59:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:59:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624258912] [2024-09-11 19:59:16,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:59:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482396753] [2024-09-11 19:59:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482396753] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:59:16,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:59:16,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:59:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51156377] [2024-09-11 19:59:16,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:59:16,733 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:59:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:59:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:59:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:59:16,734 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:59:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:59:16,809 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-09-11 19:59:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:59:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-11 19:59:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:59:16,811 INFO L225 Difference]: With dead ends: 31 [2024-09-11 19:59:16,811 INFO L226 Difference]: Without dead ends: 29 [2024-09-11 19:59:16,811 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:59:16,812 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:59:16,813 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:59:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-11 19:59:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-11 19:59:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:59:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-11 19:59:16,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-09-11 19:59:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:59:16,849 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-11 19:59:16,849 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:59:16,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-11 19:59:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:59:16,852 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:59:16,852 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:59:16,873 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-11 19:59:17,056 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:59:17,058 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:59:17,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash -73181088, now seen corresponding path program 1 times [2024-09-11 19:59:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:59:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375718476] [2024-09-11 19:59:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:59:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:59:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:59:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:59:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:59:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375718476] [2024-09-11 19:59:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375718476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:59:17,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:59:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:59:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751016258] [2024-09-11 19:59:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:59:17,186 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:59:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:59:17,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:59:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:59:17,187 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:59:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:59:17,203 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-11 19:59:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:59:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-11 19:59:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:59:17,206 INFO L225 Difference]: With dead ends: 35 [2024-09-11 19:59:17,206 INFO L226 Difference]: Without dead ends: 27 [2024-09-11 19:59:17,207 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:59:17,208 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:59:17,208 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:59:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-11 19:59:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-11 19:59:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:59:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-11 19:59:17,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2024-09-11 19:59:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:59:17,215 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-11 19:59:17,216 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:59:17,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-11 19:59:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:59:17,217 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:59:17,217 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:59:17,217 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:59:17,217 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:59:17,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash 93929903, now seen corresponding path program 1 times [2024-09-11 19:59:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:59:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662997546] [2024-09-11 19:59:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:59:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:59:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:59:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 19:59:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:59:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:59:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662997546] [2024-09-11 19:59:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662997546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:59:17,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564358288] [2024-09-11 19:59:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:17,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:59:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:59:17,592 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-11 19:59:17,595 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-11 19:59:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:17,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 19:59:17,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:59:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:59:17,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:59:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:59:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564358288] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:59:18,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:59:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-09-11 19:59:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525278361] [2024-09-11 19:59:18,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:59:18,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 19:59:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:59:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 19:59:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:59:18,075 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:59:22,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:59:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:59:22,436 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-09-11 19:59:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:59:22,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-09-11 19:59:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:59:22,437 INFO L225 Difference]: With dead ends: 41 [2024-09-11 19:59:22,437 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 19:59:22,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:59:22,439 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:59:22,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 137 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-11 19:59:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 19:59:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-11 19:59:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:59:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-09-11 19:59:22,448 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 25 [2024-09-11 19:59:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:59:22,449 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-09-11 19:59:22,449 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:59:22,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-09-11 19:59:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-11 19:59:22,451 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:59:22,451 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:59:22,468 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:59:22,655 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-11 19:59:22,656 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:59:22,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:59:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash -870264245, now seen corresponding path program 1 times [2024-09-11 19:59:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:59:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619727003] [2024-09-11 19:59:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:59:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:59:22,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847893521] [2024-09-11 19:59:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:59:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:59:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:59:22,700 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-11 19:59:22,702 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-11 19:59:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:59:22,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-11 19:59:22,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:59:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:59:23,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:59:39,534 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615) 1) 18446744073709551616) 0))) is different from true [2024-09-11 20:00:08,105 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0))) is different from true [2024-09-11 20:00:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2024-09-11 20:00:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:00:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619727003] [2024-09-11 20:00:33,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:00:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847893521] [2024-09-11 20:00:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847893521] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:00:33,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:00:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-09-11 20:00:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275789447] [2024-09-11 20:00:33,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:00:33,011 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:00:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:00:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:00:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=198, Unknown=3, NotChecked=58, Total=306 [2024-09-11 20:00:33,012 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-11 20:00:41,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:00:53,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:00:57,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:01:01,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:01:05,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:01:09,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:01:13,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:01:17,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:01:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:17,774 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-09-11 20:01:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:01:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 34 [2024-09-11 20:01:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:17,777 INFO L225 Difference]: With dead ends: 56 [2024-09-11 20:01:17,777 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 20:01:17,777 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=71, Invalid=274, Unknown=5, NotChecked=70, Total=420 [2024-09-11 20:01:17,778 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:17,779 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 155 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 8 Unknown, 103 Unchecked, 32.4s Time] [2024-09-11 20:01:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 20:01:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-09-11 20:01:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:01:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-09-11 20:01:17,797 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 34 [2024-09-11 20:01:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:17,797 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-09-11 20:01:17,797 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-11 20:01:17,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-09-11 20:01:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:01:17,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:17,799 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:17,816 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:01:17,999 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-11 20:01:18,000 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:18,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1291924684, now seen corresponding path program 1 times [2024-09-11 20:01:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:18,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238534930] [2024-09-11 20:01:18,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:18,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:01:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:18,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 20:01:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:18,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:01:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:18,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 20:01:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:01:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:01:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238534930] [2024-09-11 20:01:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238534930] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:01:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800393470] [2024-09-11 20:01:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:18,145 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-11 20:01:18,146 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-11 20:01:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:01:18,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:01:18,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:01:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:01:18,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:01:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:01:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800393470] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:01:18,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:01:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2024-09-11 20:01:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170047592] [2024-09-11 20:01:18,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:01:18,332 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:01:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:01:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:01:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:01:18,333 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-11 20:01:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:01:18,437 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-09-11 20:01:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:01:18,437 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 35 [2024-09-11 20:01:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:01:18,438 INFO L225 Difference]: With dead ends: 70 [2024-09-11 20:01:18,439 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:01:18,440 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:01:18,440 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:01:18,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 73 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:01:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:01:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-11 20:01:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:01:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2024-09-11 20:01:18,479 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 35 [2024-09-11 20:01:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:01:18,480 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2024-09-11 20:01:18,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-11 20:01:18,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2024-09-11 20:01:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 20:01:18,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:01:18,483 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:01:18,501 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:01:18,685 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-11 20:01:18,685 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:01:18,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:01:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 963629389, now seen corresponding path program 2 times [2024-09-11 20:01:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:01:18,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031602115] [2024-09-11 20:01:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:01:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:01:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:01:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318658330] [2024-09-11 20:01:18,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:01:18,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:01:18,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:01:18,740 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-11 20:01:18,744 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-11 20:01:18,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:01:18,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:01:18,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 20:01:18,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:01:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 10 proven. 58 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-11 20:01:19,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:02:34,137 WARN L876 $PredicateComparison]: unable to prove that (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) is different from true [2024-09-11 20:02:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 10 proven. 0 refuted. 36 times theorem prover too weak. 44 trivial. 19 not checked. [2024-09-11 20:02:34,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:02:34,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031602115] [2024-09-11 20:02:34,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:02:34,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318658330] [2024-09-11 20:02:34,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318658330] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:02:34,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:02:34,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2024-09-11 20:02:34,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665700905] [2024-09-11 20:02:34,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:02:34,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:02:34,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:02:34,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:02:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=253, Unknown=13, NotChecked=34, Total=380 [2024-09-11 20:02:34,198 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 15 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-11 20:02:38,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:02:56,894 WARN L293 SmtUtils]: Spent 17.32s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:03:01,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:05,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:26,608 WARN L293 SmtUtils]: Spent 12.53s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:03:30,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:34,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:38,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:42,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:46,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:03:50,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []