./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/geo3-ll.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/nla-digbench/geo3-ll.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 b0663a972595d8c4b6276a9946946503b664513e1454270179d5fa7270967446 --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 23:12:57,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 23:12:57,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 23:12:57,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 23:12:57,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 23:12:57,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 23:12:57,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 23:12:57,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 23:12:57,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 23:12:57,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 23:12:57,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 23:12:57,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 23:12:57,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 23:12:57,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 23:12:57,427 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 23:12:57,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 23:12:57,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 23:12:57,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 23:12:57,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 23:12:57,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 23:12:57,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 23:12:57,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 23:12:57,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 23:12:57,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 23:12:57,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 23:12:57,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 23:12:57,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 23:12:57,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 23:12:57,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 23:12:57,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 23:12:57,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 23:12:57,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 23:12:57,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:12:57,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 23:12:57,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 23:12:57,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 23:12:57,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 23:12:57,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 23:12:57,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 23:12:57,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 23:12:57,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 23:12:57,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 23:12:57,438 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 -> b0663a972595d8c4b6276a9946946503b664513e1454270179d5fa7270967446 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 23:12:57,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 23:12:57,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 23:12:57,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 23:12:57,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 23:12:57,679 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 23:12:57,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench/geo3-ll.c [2024-09-12 23:12:58,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 23:12:59,151 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 23:12:59,151 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/geo3-ll.c [2024-09-12 23:12:59,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/48fc0712b/1c6d41b2dbb040188377d71e2164f0bd/FLAG1d45a34c4 [2024-09-12 23:12:59,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/48fc0712b/1c6d41b2dbb040188377d71e2164f0bd [2024-09-12 23:12:59,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 23:12:59,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 23:12:59,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 23:12:59,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 23:12:59,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 23:12:59,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b557af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59, skipping insertion in model container [2024-09-12 23:12:59,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 23:12:59,363 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/geo3-ll.c[525,538] [2024-09-12 23:12:59,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:12:59,391 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 23:12:59,401 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/geo3-ll.c[525,538] [2024-09-12 23:12:59,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:12:59,428 INFO L204 MainTranslator]: Completed translation [2024-09-12 23:12:59,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59 WrapperNode [2024-09-12 23:12:59,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 23:12:59,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 23:12:59,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 23:12:59,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 23:12:59,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,450 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 23:12:59,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 23:12:59,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 23:12:59,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 23:12:59,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 23:12:59,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,469 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 23:12:59,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 23:12:59,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 23:12:59,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 23:12:59,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 23:12:59,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (1/1) ... [2024-09-12 23:12:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:12:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:12:59,513 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 23:12:59,515 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 23:12:59,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 23:12:59,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 23:12:59,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 23:12:59,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 23:12:59,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 23:12:59,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 23:12:59,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 23:12:59,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 23:12:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 23:12:59,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 23:12:59,624 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 23:12:59,626 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 23:12:59,740 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-12 23:12:59,740 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 23:12:59,757 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 23:12:59,757 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 23:12:59,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:12:59 BoogieIcfgContainer [2024-09-12 23:12:59,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 23:12:59,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 23:12:59,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 23:12:59,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 23:12:59,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 11:12:59" (1/3) ... [2024-09-12 23:12:59,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734923fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:12:59, skipping insertion in model container [2024-09-12 23:12:59,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:12:59" (2/3) ... [2024-09-12 23:12:59,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734923fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:12:59, skipping insertion in model container [2024-09-12 23:12:59,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:12:59" (3/3) ... [2024-09-12 23:12:59,768 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll.c [2024-09-12 23:12:59,783 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 23:12:59,784 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 23:12:59,836 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 23:12:59,842 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;@65a19c62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 23:12:59,842 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 23:12:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 23:12:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 23:12:59,852 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:12:59,853 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:12:59,853 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:12:59,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:12:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1657720500, now seen corresponding path program 1 times [2024-09-12 23:12:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:12:59,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144678039] [2024-09-12 23:12:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:12:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:12:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:12:59,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:12:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:12:59,983 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 23:12:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:12:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144678039] [2024-09-12 23:12:59,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144678039] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:12:59,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:12:59,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 23:12:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386815984] [2024-09-12 23:12:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:12:59,991 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 23:12:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:13:00,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 23:13:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 23:13:00,014 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 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 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 23:13:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:13:00,034 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-09-12 23:13:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 23:13:00,037 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 23:13:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:13:00,042 INFO L225 Difference]: With dead ends: 33 [2024-09-12 23:13:00,042 INFO L226 Difference]: Without dead ends: 15 [2024-09-12 23:13:00,045 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 23:13:00,048 INFO L434 NwaCegarLoop]: 18 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, 18 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 23:13:00,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:13:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-12 23:13:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-12 23:13:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:13:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-09-12 23:13:00,085 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-09-12 23:13:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:13:00,086 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-09-12 23:13:00,087 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 23:13:00,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:13:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-09-12 23:13:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 23:13:00,088 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:13:00,089 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:13:00,089 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 23:13:00,089 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:13:00,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:13:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1665168250, now seen corresponding path program 1 times [2024-09-12 23:13:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:13:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804691187] [2024-09-12 23:13:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:13:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:13:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:13:00,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996747613] [2024-09-12 23:13:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:13:00,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:13:00,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:13:00,154 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 23:13:00,167 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 23:13:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:13:00,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 23:13:00,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:13:00,414 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 23:13:00,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 23:13:00,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:13:00,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804691187] [2024-09-12 23:13:00,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:13:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996747613] [2024-09-12 23:13:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996747613] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:13:00,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:13:00,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 23:13:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922695719] [2024-09-12 23:13:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:13:00,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 23:13:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:13:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 23:13:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:13:00,424 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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 23:13:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:13:00,488 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-12 23:13:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 23:13:00,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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 23:13:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:13:00,489 INFO L225 Difference]: With dead ends: 25 [2024-09-12 23:13:00,489 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 23:13:00,490 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-12 23:13:00,491 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:13:00,491 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:13:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 23:13:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-12 23:13:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:13:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-09-12 23:13:00,503 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2024-09-12 23:13:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:13:00,503 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-09-12 23:13:00,503 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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 23:13:00,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:13:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-09-12 23:13:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 23:13:00,506 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:13:00,506 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:13:00,518 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 23:13:00,707 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-12 23:13:00,708 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:13:00,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:13:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -718657998, now seen corresponding path program 1 times [2024-09-12 23:13:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:13:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860499824] [2024-09-12 23:13:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:13:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:13:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:13:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555121178] [2024-09-12 23:13:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:13:00,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:13:00,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:13:00,769 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 23:13:00,769 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 23:13:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:13:00,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 23:13:00,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:13:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:13:01,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:13:17,712 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0)) 18446744073709551616) 0) (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0) (* 18446744073709551615 c_main_~x~0) c_main_~a~0) 18446744073709551616) 0))) is different from true [2024-09-12 23:13:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-12 23:13:25,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:13:25,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860499824] [2024-09-12 23:13:25,878 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:13:25,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555121178] [2024-09-12 23:13:25,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555121178] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:13:25,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:13:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-09-12 23:13:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235620127] [2024-09-12 23:13:25,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:13:25,879 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 23:13:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:13:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 23:13:25,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=83, Unknown=2, NotChecked=18, Total=132 [2024-09-12 23:13:25,881 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:13:34,523 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-12 23:13:38,541 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-12 23:13:42,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:13:46,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:13:50,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:13:54,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-12 23:13:58,635 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-12 23:13:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:13:58,636 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-12 23:13:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 23:13:58,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2024-09-12 23:13:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:13:58,641 INFO L225 Difference]: With dead ends: 38 [2024-09-12 23:13:58,641 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 23:13:58,642 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=42, Invalid=116, Unknown=2, NotChecked=22, Total=182 [2024-09-12 23:13:58,643 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2024-09-12 23:13:58,643 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 7 Unknown, 36 Unchecked, 28.5s Time] [2024-09-12 23:13:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 23:13:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-12 23:13:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 23:13:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-09-12 23:13:58,656 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 17 [2024-09-12 23:13:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:13:58,657 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-09-12 23:13:58,657 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 10 states have internal predecessors, (17), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:13:58,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:13:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-09-12 23:13:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 23:13:58,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:13:58,659 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:13:58,670 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 23:13:58,860 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:13:58,861 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:13:58,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:13:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1515570810, now seen corresponding path program 2 times [2024-09-12 23:13:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:13:58,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884982113] [2024-09-12 23:13:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:13:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:13:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:13:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694280904] [2024-09-12 23:13:58,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:13:58,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:13:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:13:58,913 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 23:13:58,914 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 23:14:00,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:14:00,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:14:00,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-12 23:14:00,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:14:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 23:14:01,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:14:21,268 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0)) 18446744073709551616) 0) (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0) (* 18446744073709551615 c_main_~x~0) c_main_~a~0) 18446744073709551616) 0))) is different from true [2024-09-12 23:14:41,459 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:14:45,487 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0) (not (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0)) 18446744073709551616) 0))) is different from true [2024-09-12 23:14:57,557 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:15:18,192 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:15:30,220 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:15:43,041 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:15:55,067 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:16:19,160 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:16:31,181 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:16:47,253 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:16:59,278 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:17:23,328 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:17:35,351 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:17:59,544 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:18:11,560 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:18:19,613 WARN L876 $PredicateComparison]: unable to prove that (and (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse0 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse0)) 18446744073709551616) 0)) (< .cse0 1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse0) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse1)) 18446744073709551616) 0)) (< 0 .cse1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_z_1 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse2 (+ v_z_1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616)))) (or (= .cse2 0) (= (mod (+ (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_z_1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0) (< v_z_1 0) (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_z_1) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616) 0)) (< 18446744073709551615 v_z_1) (= 18446744073709551616 .cse2)))))) is different from true [2024-09-12 23:18:39,761 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:18:51,776 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:19:15,850 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:19:27,862 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:19:48,454 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:20:00,556 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:20:12,751 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:20:24,762 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:20:44,905 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:20:56,927 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:21:20,974 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:21:32,984 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:21:53,087 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:22:05,193 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:22:17,323 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:22:29,352 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:22:33,380 WARN L854 $PredicateComparison]: unable to prove that (or (and (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse0 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse0)) 18446744073709551616) 0)) (< .cse0 1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse0) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse1)) 18446744073709551616) 0)) (< 0 .cse1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_z_1 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse2 (+ v_z_1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616)))) (or (= .cse2 0) (= (mod (+ (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_z_1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0) (< v_z_1 0) (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_z_1) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616) 0)) (< 18446744073709551615 v_z_1) (= 18446744073709551616 .cse2)))))) (= c___VERIFIER_assert_~cond 0)) is different from false [2024-09-12 23:22:37,390 WARN L876 $PredicateComparison]: unable to prove that (or (and (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse0 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse0)) 18446744073709551616) 0)) (< .cse0 1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse0) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse1)) 18446744073709551616) 0)) (< 0 .cse1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_z_1 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse2 (+ v_z_1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616)))) (or (= .cse2 0) (= (mod (+ (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_z_1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0) (< v_z_1 0) (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_z_1) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616) 0)) (< 18446744073709551615 v_z_1) (= 18446744073709551616 .cse2)))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-12 23:22:57,481 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:23:09,500 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:23:34,284 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:23:46,294 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:23:54,331 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse0 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse0)) 18446744073709551616) 0)) (< .cse0 1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse0) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse1)) 18446744073709551616) 0)) (< 0 .cse1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))))) is different from true [2024-09-12 23:23:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 1 refuted. 1 times theorem prover too weak. 13 trivial. 8 not checked. [2024-09-12 23:23:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:23:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884982113] [2024-09-12 23:23:54,387 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:23:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694280904] [2024-09-12 23:23:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694280904] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:23:54,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:23:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2024-09-12 23:23:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493399119] [2024-09-12 23:23:54,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:23:54,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 23:23:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:23:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 23:23:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=146, Unknown=7, NotChecked=140, Total=342 [2024-09-12 23:23:54,389 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-12 23:25:10,998 WARN L293 SmtUtils]: Spent 1.21m on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:26:44,194 WARN L293 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 67 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:26:48,242 WARN L876 $PredicateComparison]: unable to prove that (and (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse0 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse0)) 18446744073709551616) 0)) (< .cse0 1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse0) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse1)) 18446744073709551616) 0)) (< 0 .cse1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_z_1 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse2 (+ v_z_1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616)))) (or (= .cse2 0) (= (mod (+ (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_z_1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0) (< v_z_1 0) (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_z_1) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616) 0)) (< 18446744073709551615 v_z_1) (= 18446744073709551616 .cse2))))) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from true [2024-09-12 23:26:52,251 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and .cse0 (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (and (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse1)) 18446744073709551616) 0)) (< .cse1 1) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse2 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616))) (or (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 .cse2)) 18446744073709551616) 0)) (< 0 .cse2) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 .cse2) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0)))))) (or .cse0 (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_11 Int) (v_z_1 Int) (v_main_~az~0_BEFORE_CALL_11 Int)) (let ((.cse3 (+ v_z_1 (mod (+ (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616)))) (or (= .cse3 0) (= (mod (+ (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_z_1) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11)) 18446744073709551616) 0) (< v_z_1 0) (not (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_11 v_main_~y~0_BEFORE_CALL_11 v_main_~az~0_BEFORE_CALL_11) (* v_main_~z~0_BEFORE_CALL_11 v_z_1) (* v_main_~z~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_11 v_main_~x~0_BEFORE_CALL_11)) 18446744073709551616) 0)) (< 18446744073709551615 v_z_1) (= 18446744073709551616 .cse3))))))) is different from true [2024-09-12 23:27:14,242 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 25 DAG size of output: 23 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:27:18,245 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-12 23:27:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:27:23,157 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-09-12 23:27:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 23:27:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2024-09-12 23:27:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:27:23,158 INFO L225 Difference]: With dead ends: 37 [2024-09-12 23:27:23,158 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 23:27:23,159 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 236.4s TimeCoverageRelationStatistics Valid=83, Invalid=233, Unknown=18, NotChecked=266, Total=600 [2024-09-12 23:27:23,159 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-09-12 23:27:23,160 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 1 Unknown, 212 Unchecked, 4.5s Time] [2024-09-12 23:27:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 23:27:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 23:27:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 23:27:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 23:27:23,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-09-12 23:27:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:27:23,165 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 23:27:23,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-12 23:27:23,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:27:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 23:27:23,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 23:27:23,168 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 23:27:23,177 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 23:27:23,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:27:23,372 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-09-12 23:27:23,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Killed by 15