./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound20.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound20.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdadba64290bb92644e7e488fd7f0ff193dc3cda62b54e30ca2f0fabf2570055 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:04:11,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:04:11,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:04:11,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:04:11,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:04:11,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:04:11,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:04:11,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:04:11,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:04:11,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:04:11,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:04:11,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:04:11,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:04:11,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:04:11,210 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:04:11,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:04:11,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:04:11,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:04:11,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:04:11,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:04:11,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:04:11,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:04:11,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:04:11,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:04:11,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:04:11,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:04:11,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:04:11,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:04:11,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:04:11,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:04:11,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:04:11,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:04:11,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:04:11,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:04:11,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:04:11,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:04:11,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:04:11,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:04:11,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:04:11,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:04:11,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:04:11,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:04:11,218 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 -> fdadba64290bb92644e7e488fd7f0ff193dc3cda62b54e30ca2f0fabf2570055 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:04:11,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:04:11,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:04:11,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:04:11,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:04:11,468 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:04:11,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound20.c [2024-09-25 11:04:12,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:04:12,828 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:04:12,828 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound20.c [2024-09-25 11:04:12,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a714ef532/8aef51e0de4d45988da04fceb0ad880f/FLAGa11a12c85 [2024-09-25 11:04:13,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a714ef532/8aef51e0de4d45988da04fceb0ad880f [2024-09-25 11:04:13,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:04:13,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:04:13,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:04:13,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:04:13,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:04:13,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787b272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13, skipping insertion in model container [2024-09-25 11:04:13,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:04:13,343 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound20.c[525,538] [2024-09-25 11:04:13,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:04:13,372 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:04:13,382 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound20.c[525,538] [2024-09-25 11:04:13,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:04:13,400 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:04:13,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13 WrapperNode [2024-09-25 11:04:13,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:04:13,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:04:13,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:04:13,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:04:13,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,415 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:04:13,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:04:13,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:04:13,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:04:13,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:04:13,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,436 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-25 11:04:13,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:04:13,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:04:13,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:04:13,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:04:13,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (1/1) ... [2024-09-25 11:04:13,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:04:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:04:13,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-25 11:04:13,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-25 11:04:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:04:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:04:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:04:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:04:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:04:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:04:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:04:13,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:04:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:04:13,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:04:13,608 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:04:13,610 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:04:13,717 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 11:04:13,718 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:04:13,738 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:04:13,738 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 11:04:13,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:04:13 BoogieIcfgContainer [2024-09-25 11:04:13,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:04:13,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:04:13,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:04:13,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:04:13,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:04:13" (1/3) ... [2024-09-25 11:04:13,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e18b936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:04:13, skipping insertion in model container [2024-09-25 11:04:13,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:04:13" (2/3) ... [2024-09-25 11:04:13,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e18b936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:04:13, skipping insertion in model container [2024-09-25 11:04:13,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:04:13" (3/3) ... [2024-09-25 11:04:13,745 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound20.c [2024-09-25 11:04:13,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:04:13,758 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:04:13,793 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:04:13,798 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;@3f34857a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:04:13,799 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:04:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-25 11:04:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 11:04:13,809 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:04:13,810 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:04:13,810 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:04:13,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1030420147, now seen corresponding path program 1 times [2024-09-25 11:04:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:04:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350209493] [2024-09-25 11:04:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:04:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:13,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:04:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:13,964 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-25 11:04:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:04:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350209493] [2024-09-25 11:04:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350209493] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:04:13,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:04:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 11:04:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833543621] [2024-09-25 11:04:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:04:13,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 11:04:13,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:04:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 11:04:13,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 11:04:13,993 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:04:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:04:14,045 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-09-25 11:04:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 11:04:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 11:04:14,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:04:14,052 INFO L225 Difference]: With dead ends: 36 [2024-09-25 11:04:14,052 INFO L226 Difference]: Without dead ends: 17 [2024-09-25 11:04:14,054 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 11:04:14,056 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:04:14,059 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:04:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-25 11:04:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-09-25 11:04:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-25 11:04:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-25 11:04:14,082 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2024-09-25 11:04:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:04:14,082 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-25 11:04:14,082 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:04:14,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-25 11:04:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 11:04:14,083 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:04:14,083 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:04:14,083 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:04:14,083 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:04:14,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2015485711, now seen corresponding path program 1 times [2024-09-25 11:04:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:04:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102790146] [2024-09-25 11:04:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:04:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:04:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,223 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-25 11:04:14,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:04:14,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102790146] [2024-09-25 11:04:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102790146] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:04:14,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:04:14,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 11:04:14,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845148918] [2024-09-25 11:04:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:04:14,225 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:04:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:04:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:04:14,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:04:14,226 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:04:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:04:14,277 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-25 11:04:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:04:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 11:04:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:04:14,278 INFO L225 Difference]: With dead ends: 25 [2024-09-25 11:04:14,278 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 11:04:14,278 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-25 11:04:14,279 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:04:14,279 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:04:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 11:04:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-25 11:04:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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-25 11:04:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-25 11:04:14,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-09-25 11:04:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:04:14,289 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-25 11:04:14,289 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:04:14,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-25 11:04:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 11:04:14,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:04:14,291 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:04:14,291 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:04:14,292 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:04:14,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2017273171, now seen corresponding path program 1 times [2024-09-25 11:04:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:04:14,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713391825] [2024-09-25 11:04:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:04:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:04:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165149815] [2024-09-25 11:04:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:04:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:04:14,317 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-25 11:04:14,319 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-25 11:04:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 11:04:14,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:04:14,467 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-25 11:04:14,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:04:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:04:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713391825] [2024-09-25 11:04:14,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:04:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165149815] [2024-09-25 11:04:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165149815] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:04:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:04:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:04:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363518387] [2024-09-25 11:04:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:04:14,471 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:04:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:04:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:04:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:04:14,472 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-25 11:04:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:04:14,538 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-09-25 11:04:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:04:14,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2024-09-25 11:04:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:04:14,539 INFO L225 Difference]: With dead ends: 27 [2024-09-25 11:04:14,539 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 11:04:14,540 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-25 11:04:14,540 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 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.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:04:14,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:04:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 11:04:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-25 11:04:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-25 11:04:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-25 11:04:14,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2024-09-25 11:04:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:04:14,547 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-25 11:04:14,547 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-25 11:04:14,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-25 11:04:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 11:04:14,550 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:04:14,550 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:04:14,562 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:04:14,750 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:04:14,751 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:04:14,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash -810508528, now seen corresponding path program 1 times [2024-09-25 11:04:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:04:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394015118] [2024-09-25 11:04:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:04:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:04:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:04:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:04:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:04:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394015118] [2024-09-25 11:04:14,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394015118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:04:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721038788] [2024-09-25 11:04:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:14,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:04:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:04:14,911 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-25 11:04:14,912 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-25 11:04:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:14,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:04:14,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:04:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:04:14,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:04:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:04:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721038788] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:04:15,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:04:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-25 11:04:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701124567] [2024-09-25 11:04:15,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:04:15,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 11:04:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:04:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 11:04:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:04:15,055 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 11:04:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:04:15,183 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-09-25 11:04:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:04:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 19 [2024-09-25 11:04:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:04:15,184 INFO L225 Difference]: With dead ends: 55 [2024-09-25 11:04:15,185 INFO L226 Difference]: Without dead ends: 48 [2024-09-25 11:04:15,185 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-09-25 11:04:15,187 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:04:15,187 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:04:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-25 11:04:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-09-25 11:04:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 11:04:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-09-25 11:04:15,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2024-09-25 11:04:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:04:15,201 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-09-25 11:04:15,201 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 11:04:15,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-09-25 11:04:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 11:04:15,203 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:04:15,203 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:04:15,218 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:04:15,403 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:04:15,404 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:04:15,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:04:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -808721068, now seen corresponding path program 1 times [2024-09-25 11:04:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:04:15,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027451602] [2024-09-25 11:04:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:04:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:04:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879400282] [2024-09-25 11:04:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:04:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:04:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:04:15,420 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-25 11:04:15,422 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-25 11:04:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:04:15,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 11:04:15,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:04:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:04:15,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:04:32,044 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-25 11:04:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-09-25 11:04:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:04:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027451602] [2024-09-25 11:04:48,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:04:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879400282] [2024-09-25 11:04:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879400282] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:04:48,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:04:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-09-25 11:04:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378331776] [2024-09-25 11:04:48,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:04:48,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 11:04:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:04:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 11:04:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=83, Unknown=2, NotChecked=18, Total=132 [2024-09-25 11:04:48,775 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 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-25 11:04:57,118 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-25 11:05:01,126 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-25 11:05:05,131 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-25 11:05:09,138 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-25 11:05:13,143 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-25 11:05:17,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 11:05:21,153 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-25 11:05:25,174 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-25 11:05:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:25,175 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-09-25 11:05:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:05:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 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 19 [2024-09-25 11:05:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:25,181 INFO L225 Difference]: With dead ends: 52 [2024-09-25 11:05:25,181 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:05:25,182 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=42, Invalid=116, Unknown=2, NotChecked=22, Total=182 [2024-09-25 11:05:25,182 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:25,183 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 8 Unknown, 42 Unchecked, 32.3s Time] [2024-09-25 11:05:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:05:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 11:05:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.0625) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 11:05:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-09-25 11:05:25,193 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 19 [2024-09-25 11:05:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:25,193 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-09-25 11:05:25,194 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 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-25 11:05:25,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-09-25 11:05:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 11:05:25,195 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:25,195 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:25,203 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-25 11:05:25,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:25,396 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:25,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1627686637, now seen corresponding path program 2 times [2024-09-25 11:05:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:25,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235184123] [2024-09-25 11:05:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:25,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:05:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:25,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:05:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:25,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 11:05:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:25,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:05:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:25,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 11:05:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:05:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:05:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:05:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235184123] [2024-09-25 11:05:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235184123] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:05:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219389397] [2024-09-25 11:05:25,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:05:25,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:25,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:25,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:25,591 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:05:25,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:05:25,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:05:25,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 11:05:25,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:05:25,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:05:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219389397] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:05:25,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:05:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-09-25 11:05:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056974317] [2024-09-25 11:05:25,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:05:25,817 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 11:05:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:05:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 11:05:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-09-25 11:05:25,818 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 13 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 11:05:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:05:26,113 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-09-25 11:05:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-25 11:05:26,114 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 13 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) Word has length 43 [2024-09-25 11:05:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:05:26,115 INFO L225 Difference]: With dead ends: 107 [2024-09-25 11:05:26,115 INFO L226 Difference]: Without dead ends: 100 [2024-09-25 11:05:26,116 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 11:05:26,116 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:05:26,116 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 37 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:05:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-25 11:05:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2024-09-25 11:05:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 66 states have internal predecessors, (72), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 11:05:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-09-25 11:05:26,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 43 [2024-09-25 11:05:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:05:26,134 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-09-25 11:05:26,134 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 13 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 11:05:26,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-09-25 11:05:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 11:05:26,136 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:05:26,136 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:05:26,149 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:05:26,337 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:26,337 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:05:26,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:05:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1625899177, now seen corresponding path program 2 times [2024-09-25 11:05:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:05:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513953642] [2024-09-25 11:05:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:05:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:05:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:05:26,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47184530] [2024-09-25 11:05:26,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:05:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:05:26,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:05:26,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:05:26,383 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:05:26,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:05:26,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:05:26,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-25 11:05:26,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:05:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:05:27,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:05:47,804 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-25 11:06:12,147 WARN L293 SmtUtils]: Spent 8.05s 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-25 11:06:20,219 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-25 11:06:32,271 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-25 11:06:48,441 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-25 11:06:52,672 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) (* 18446744073709551615 c_main_~y~0 c_main_~az~0) (* 18446744073709551615 c_main_~x~0) c_main_~a~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-25 11:07:12,768 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-25 11:07:18,701 WARN L293 SmtUtils]: Spent 5.93s 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-25 11:07:26,723 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-25 11:07:38,746 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-25 11:07:50,761 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-25 11:07:54,778 WARN L876 $PredicateComparison]: unable to prove that (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 ((.cse0 (+ 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 (= .cse0 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 .cse0))))) is different from true [2024-09-25 11:08:10,818 WARN L293 SmtUtils]: Spent 12.02s 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-25 11:08:22,960 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-25 11:08:35,338 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-25 11:08:47,363 WARN L293 SmtUtils]: Spent 12.02s 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)