./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound100.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-scaling/geo3-ll_unwindbound100.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 83bed6e49bdb654de8fe1de7185cbf6d5882b20900f65bc5284ec8c205f21415 --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-13 01:28:06,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:28:06,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:28:06,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:28:06,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:28:07,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:28:07,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:28:07,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:28:07,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:28:07,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:28:07,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:28:07,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:28:07,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:28:07,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:28:07,042 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:28:07,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:28:07,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:28:07,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:28:07,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:28:07,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:28:07,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:28:07,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:28:07,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:28:07,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:28:07,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:28:07,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:28:07,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:28:07,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:28:07,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:28:07,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:28:07,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:28:07,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:28:07,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:28:07,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:28:07,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:28:07,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:28:07,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:28:07,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:28:07,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:28:07,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:28:07,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:28:07,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:28:07,056 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 -> 83bed6e49bdb654de8fe1de7185cbf6d5882b20900f65bc5284ec8c205f21415 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-13 01:28:07,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:28:07,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:28:07,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:28:07,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:28:07,305 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:28:07,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound100.c [2024-09-13 01:28:08,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:28:08,898 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:28:08,899 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound100.c [2024-09-13 01:28:08,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1bba5edb9/562388787a6f4865a575b160e56bf3c7/FLAGe269df2c8 [2024-09-13 01:28:08,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1bba5edb9/562388787a6f4865a575b160e56bf3c7 [2024-09-13 01:28:08,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:28:08,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:28:08,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:28:08,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:28:08,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:28:08,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:28:08" (1/1) ... [2024-09-13 01:28:08,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44db0f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:08, skipping insertion in model container [2024-09-13 01:28:08,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:28:08" (1/1) ... [2024-09-13 01:28:08,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:28:09,078 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound100.c[525,538] [2024-09-13 01:28:09,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:28:09,100 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:28:09,112 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound100.c[525,538] [2024-09-13 01:28:09,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:28:09,131 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:28:09,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09 WrapperNode [2024-09-13 01:28:09,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:28:09,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:28:09,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:28:09,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:28:09,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,152 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:28:09,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:28:09,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:28:09,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:28:09,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:28:09,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,181 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-13 01:28:09,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:28:09,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:28:09,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:28:09,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:28:09,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (1/1) ... [2024-09-13 01:28:09,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:28:09,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:28:09,236 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-13 01:28:09,242 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-13 01:28:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:28:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:28:09,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:28:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:28:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:28:09,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:28:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:28:09,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:28:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:28:09,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:28:09,347 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:28:09,349 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:28:09,472 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-13 01:28:09,472 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:28:09,492 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:28:09,493 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 01:28:09,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:28:09 BoogieIcfgContainer [2024-09-13 01:28:09,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:28:09,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:28:09,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:28:09,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:28:09,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:28:08" (1/3) ... [2024-09-13 01:28:09,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82fd293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:28:09, skipping insertion in model container [2024-09-13 01:28:09,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:28:09" (2/3) ... [2024-09-13 01:28:09,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82fd293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:28:09, skipping insertion in model container [2024-09-13 01:28:09,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:28:09" (3/3) ... [2024-09-13 01:28:09,501 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound100.c [2024-09-13 01:28:09,517 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:28:09,518 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:28:09,564 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:28:09,569 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;@379c917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:28:09,569 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:28:09,573 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-13 01:28:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 01:28:09,580 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:28:09,580 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:28:09,581 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:28:09,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1030420147, now seen corresponding path program 1 times [2024-09-13 01:28:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:28:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27396267] [2024-09-13 01:28:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:28:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:09,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:28:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:09,796 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-13 01:28:09,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:28:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27396267] [2024-09-13 01:28:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27396267] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:28:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:28:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 01:28:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532116771] [2024-09-13 01:28:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:28:09,812 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 01:28:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:28:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 01:28:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 01:28:09,844 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-13 01:28:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:28:09,928 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-09-13 01:28:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 01:28:09,930 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-13 01:28:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:28:09,941 INFO L225 Difference]: With dead ends: 36 [2024-09-13 01:28:09,942 INFO L226 Difference]: Without dead ends: 17 [2024-09-13 01:28:09,945 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-13 01:28:09,950 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:28:09,951 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.1s Time] [2024-09-13 01:28:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-13 01:28:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-09-13 01:28:09,985 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-13 01:28:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-13 01:28:09,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2024-09-13 01:28:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:28:09,988 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-13 01:28:09,989 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-13 01:28:09,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-13 01:28:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 01:28:09,991 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:28:09,991 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:28:09,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:28:09,992 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:28:09,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2015485711, now seen corresponding path program 1 times [2024-09-13 01:28:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:28:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458726971] [2024-09-13 01:28:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:28:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:10,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:28:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:10,185 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-13 01:28:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:28:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458726971] [2024-09-13 01:28:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458726971] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:28:10,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:28:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 01:28:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006726642] [2024-09-13 01:28:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:28:10,188 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:28:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:28:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:28:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:28:10,193 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-13 01:28:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:28:10,261 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-13 01:28:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 01:28:10,261 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-13 01:28:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:28:10,262 INFO L225 Difference]: With dead ends: 25 [2024-09-13 01:28:10,262 INFO L226 Difference]: Without dead ends: 18 [2024-09-13 01:28:10,263 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-13 01:28:10,264 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-13 01:28:10,265 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-13 01:28:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-13 01:28:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-13 01:28:10,273 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-13 01:28:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-13 01:28:10,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2024-09-13 01:28:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:28:10,275 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-13 01:28:10,276 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-13 01:28:10,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-13 01:28:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 01:28:10,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:28:10,278 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:28:10,278 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 01:28:10,279 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:28:10,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2017273171, now seen corresponding path program 1 times [2024-09-13 01:28:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:28:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025509835] [2024-09-13 01:28:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:28:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:28:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865676775] [2024-09-13 01:28:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:10,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:28:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:28:10,299 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-13 01:28:10,301 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-13 01:28:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:10,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 01:28:10,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:28:10,451 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-13 01:28:10,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:28:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:28:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025509835] [2024-09-13 01:28:10,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:28:10,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865676775] [2024-09-13 01:28:10,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865676775] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:28:10,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:28:10,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:28:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119869285] [2024-09-13 01:28:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:28:10,456 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:28:10,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:28:10,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:28:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:28:10,475 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-13 01:28:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:28:10,558 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-09-13 01:28:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:28:10,559 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-13 01:28:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:28:10,560 INFO L225 Difference]: With dead ends: 27 [2024-09-13 01:28:10,560 INFO L226 Difference]: Without dead ends: 24 [2024-09-13 01:28:10,560 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-13 01:28:10,561 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 01:28:10,562 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-13 01:28:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-13 01:28:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-13 01:28:10,570 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-13 01:28:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-13 01:28:10,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2024-09-13 01:28:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:28:10,571 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-13 01:28:10,571 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-13 01:28:10,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-13 01:28:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 01:28:10,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:28:10,576 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:28:10,593 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 01:28:10,777 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-13 01:28:10,778 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:28:10,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash -810508528, now seen corresponding path program 1 times [2024-09-13 01:28:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:28:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747692132] [2024-09-13 01:28:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:28:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:10,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:28:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:10,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 01:28:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:10,998 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-13 01:28:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:28:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747692132] [2024-09-13 01:28:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747692132] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:28:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571267043] [2024-09-13 01:28:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:28:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:28:11,002 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-13 01:28:11,005 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-13 01:28:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:11,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 01:28:11,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:28:11,100 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-13 01:28:11,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:28:11,179 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-13 01:28:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571267043] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:28:11,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:28:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-13 01:28:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317131051] [2024-09-13 01:28:11,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:28:11,181 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 01:28:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:28:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 01:28:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-13 01:28:11,186 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-13 01:28:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:28:11,348 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-09-13 01:28:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 01:28:11,348 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-13 01:28:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:28:11,349 INFO L225 Difference]: With dead ends: 55 [2024-09-13 01:28:11,350 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 01:28:11,350 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-13 01:28:11,351 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-13 01:28:11,352 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-13 01:28:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 01:28:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-09-13 01:28:11,362 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-13 01:28:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-09-13 01:28:11,364 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2024-09-13 01:28:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:28:11,364 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-09-13 01:28:11,364 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-13 01:28:11,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-09-13 01:28:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 01:28:11,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:28:11,366 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:28:11,378 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 01:28:11,566 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-13 01:28:11,567 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:28:11,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:28:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash -808721068, now seen corresponding path program 1 times [2024-09-13 01:28:11,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:28:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247817209] [2024-09-13 01:28:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:28:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:28:11,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956204000] [2024-09-13 01:28:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:28:11,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:28:11,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:28:11,589 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-13 01:28:11,591 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-13 01:28:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:28:11,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 01:28:11,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:28:11,887 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-13 01:28:11,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:28:28,545 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-13 01:28:45,164 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-13 01:28:45,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:28:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247817209] [2024-09-13 01:28:45,167 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:28:45,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956204000] [2024-09-13 01:28:45,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956204000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:28:45,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:28:45,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-09-13 01:28:45,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093528946] [2024-09-13 01:28:45,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:28:45,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 01:28:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:28:45,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 01:28:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=83, Unknown=2, NotChecked=18, Total=132 [2024-09-13 01:28:45,172 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-13 01:28:53,998 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-13 01:28:58,003 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-13 01:29:02,009 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-13 01:29:06,023 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-13 01:29:10,030 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-13 01:29:14,035 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-13 01:29:18,040 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-13 01:29:22,073 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-13 01:29:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:29:22,074 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-09-13 01:29:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 01:29:22,078 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-13 01:29:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:29:22,080 INFO L225 Difference]: With dead ends: 52 [2024-09-13 01:29:22,080 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 01:29:22,080 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=42, Invalid=116, Unknown=2, NotChecked=22, Total=182 [2024-09-13 01:29:22,081 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 01:29:22,081 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.4s Time] [2024-09-13 01:29:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 01:29:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-13 01:29:22,095 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-13 01:29:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-09-13 01:29:22,097 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 19 [2024-09-13 01:29:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:29:22,097 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-09-13 01:29:22,097 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-13 01:29:22,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:29:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-09-13 01:29:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 01:29:22,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:29:22,099 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:29:22,108 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 01:29:22,299 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-13 01:29:22,300 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:29:22,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:29:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1627686637, now seen corresponding path program 2 times [2024-09-13 01:29:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:29:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767661999] [2024-09-13 01:29:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:29:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:29:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:29:22,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:29:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:29:22,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 01:29:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:29:22,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 01:29:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:29:22,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:29:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:29:22,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 01:29:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:29:22,682 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-13 01:29:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:29:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767661999] [2024-09-13 01:29:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767661999] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:29:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455911133] [2024-09-13 01:29:22,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:29:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:29:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:29:22,687 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-13 01:29:22,688 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-13 01:29:22,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:29:22,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:29:22,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-13 01:29:22,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:29:22,812 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-13 01:29:22,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:29:22,949 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-13 01:29:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455911133] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:29:22,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:29:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-09-13 01:29:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205847718] [2024-09-13 01:29:22,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:29:22,951 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 01:29:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:29:22,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 01:29:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-09-13 01:29:22,953 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-13 01:29:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:29:23,393 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-09-13 01:29:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-13 01:29:23,394 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-13 01:29:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:29:23,395 INFO L225 Difference]: With dead ends: 107 [2024-09-13 01:29:23,395 INFO L226 Difference]: Without dead ends: 100 [2024-09-13 01:29:23,396 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 01:29:23,397 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:29:23,397 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.2s Time] [2024-09-13 01:29:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-13 01:29:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2024-09-13 01:29:23,416 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-13 01:29:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-09-13 01:29:23,417 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 43 [2024-09-13 01:29:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:29:23,418 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-09-13 01:29:23,418 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-13 01:29:23,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:29:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-09-13 01:29:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 01:29:23,419 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:29:23,420 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:29:23,436 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 01:29:23,623 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-13 01:29:23,624 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:29:23,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:29:23,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1625899177, now seen corresponding path program 2 times [2024-09-13 01:29:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:29:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503744792] [2024-09-13 01:29:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:29:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:29:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:29:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387143659] [2024-09-13 01:29:23,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:29:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:29:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:29:23,683 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-13 01:29:23,686 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-13 01:29:23,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:29:23,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:29:23,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-13 01:29:23,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:29:24,869 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-13 01:29:24,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:29:42,438 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-13 01:30:10,953 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-13 01:30:22,993 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:30:39,020 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-13 01:30:43,030 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-13 01:31:03,144 WARN L293 SmtUtils]: Spent 12.05s 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-13 01:31:15,410 WARN L293 SmtUtils]: Spent 8.03s 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-13 01:31:27,566 WARN L293 SmtUtils]: Spent 8.03s 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-13 01:31:39,580 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-13 01:31:43,590 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-13 01:31:59,655 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-13 01:32:11,724 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-13 01:32:24,079 WARN L293 SmtUtils]: Spent 8.03s 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-13 01:32:36,098 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) [2024-09-13 01:32:52,175 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-13 01:32:57,507 WARN L293 SmtUtils]: Spent 5.33s 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-13 01:33:05,527 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-13 01:33:17,681 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-13 01:33:29,702 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) [2024-09-13 01:33:33,714 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)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-13 01:33:45,755 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-13 01:34:02,057 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-13 01:34:14,083 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-13 01:34:30,163 WARN L293 SmtUtils]: Spent 12.05s 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-13 01:34:42,182 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:34:58,213 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-13 01:35:02,261 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (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)) (= (mod (+ (* c_main_~x~0 c_main_~z~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 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0)) is different from true [2024-09-13 01:35:14,298 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:35:30,364 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-13 01:35:42,375 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-13 01:35:46,384 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (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)) (= (mod (+ (* c_main_~x~0 c_main_~z~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 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0)) is different from true [2024-09-13 01:36:06,457 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-13 01:36:18,484 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-13 01:36:30,509 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) [2024-09-13 01:36:38,523 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-13 01:36:55,075 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-13 01:37:03,083 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-13 01:37:07,093 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_z_2 Int) (v_main_~y~0_BEFORE_CALL_12 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~az~0_BEFORE_CALL_12 Int) (v_main_~x~0_BEFORE_CALL_12 Int)) (let ((.cse0 (+ (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_12)) 18446744073709551616) v_z_2))) (or (not (= (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_z_2) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12)) 18446744073709551616) 0)) (= .cse0 0) (= .cse0 18446744073709551616) (< 18446744073709551615 v_z_2) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_z_2)) 18446744073709551616) 0) (not (= (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_z_2) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12)) 18446744073709551616) 0)) (< v_z_2 0))))) is different from true [2024-09-13 01:37:23,156 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-13 01:37:35,186 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-13 01:37:47,249 WARN L293 SmtUtils]: Spent 12.06s 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-13 01:37:55,287 WARN L293 SmtUtils]: Spent 8.04s 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-13 01:38:11,771 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:38:19,803 WARN L293 SmtUtils]: Spent 8.03s 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-13 01:38:35,862 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:38:47,873 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-13 01:38:59,901 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-13 01:39:07,930 WARN L293 SmtUtils]: Spent 8.03s 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-13 01:39:24,024 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:39:32,049 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-13 01:39:36,076 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_z_2 Int) (v_main_~y~0_BEFORE_CALL_12 Int) (v_main_~z~0_BEFORE_CALL_12 Int) (v_main_~az~0_BEFORE_CALL_12 Int) (v_main_~x~0_BEFORE_CALL_12 Int)) (let ((.cse0 (+ (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~x~0_BEFORE_CALL_12)) 18446744073709551616) v_z_2))) (or (not (= (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_z_2) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12)) 18446744073709551616) 0)) (= .cse0 0) (= .cse0 18446744073709551616) (< 18446744073709551615 v_z_2) (= (mod (+ (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_z_2)) 18446744073709551616) 0) (not (= (mod (+ (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_z_2) (* v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~y~0_BEFORE_CALL_12 v_main_~az~0_BEFORE_CALL_12) (* 18446744073709551615 v_main_~z~0_BEFORE_CALL_12 v_main_~z~0_BEFORE_CALL_12 v_main_~x~0_BEFORE_CALL_12)) 18446744073709551616) 0)) (< v_z_2 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-13 01:39:48,094 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:40:04,199 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:40:16,298 WARN L293 SmtUtils]: Spent 12.10s 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-13 01:40:28,324 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-13 01:40:44,635 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-13 01:40:56,665 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-13 01:41:08,722 WARN L293 SmtUtils]: Spent 12.04s 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-13 01:41:20,736 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:41:36,774 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-13 01:41:40,781 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (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)) (= (mod (+ (* c_main_~a~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~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_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~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_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~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_~z~0) (* c_main_~a~0 c_main_~z~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-13 01:41:52,818 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:42:04,827 WARN L293 SmtUtils]: Spent 12.01s 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-13 01:42:20,885 WARN L293 SmtUtils]: Spent 12.04s 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-13 01:42:32,904 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-13 01:42:36,910 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (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)) (= (mod (+ (* c_main_~a~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~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_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~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_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~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_~z~0) (* c_main_~a~0 c_main_~z~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 Killed by 15