./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/vnew2.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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/vnew2.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 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:21:01,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:21:01,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:21:01,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:21:01,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:21:01,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:21:01,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:21:01,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:21:01,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:21:01,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:21:01,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:21:01,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:21:01,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:21:01,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:21:01,630 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:21:01,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:21:01,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:21:01,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:21:01,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:21:01,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:21:01,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:21:01,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:21:01,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:21:01,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:21:01,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:21:01,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:21:01,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:21:01,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:21:01,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:21:01,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:21:01,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:21:01,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:21:01,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:21:01,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:21:01,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:21:01,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:21:01,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:21:01,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:21:01,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:21:01,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:21:01,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:21:01,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:21:01,640 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 -> 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:21:01,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:21:01,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:21:01,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:21:01,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:21:01,987 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:21:01,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/vnew2.c [2024-09-12 18:21:03,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:21:03,807 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:21:03,808 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew2.c [2024-09-12 18:21:03,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7c40a887a/9adeac75ba2b4e4b813c28474f5d1b4f/FLAG227494d37 [2024-09-12 18:21:03,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7c40a887a/9adeac75ba2b4e4b813c28474f5d1b4f [2024-09-12 18:21:03,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:21:03,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:21:03,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:21:03,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:21:03,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:21:03,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:21:03" (1/1) ... [2024-09-12 18:21:03,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e74e97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:03, skipping insertion in model container [2024-09-12 18:21:03,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:21:03" (1/1) ... [2024-09-12 18:21:03,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:21:04,003 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew2.c[403,416] [2024-09-12 18:21:04,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:21:04,045 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:21:04,059 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/vnew2.c[403,416] [2024-09-12 18:21:04,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:21:04,082 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:21:04,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04 WrapperNode [2024-09-12 18:21:04,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:21:04,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:21:04,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:21:04,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:21:04,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,104 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:21:04,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:21:04,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:21:04,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:21:04,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:21:04,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,138 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-12 18:21:04,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:21:04,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:21:04,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:21:04,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:21:04,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (1/1) ... [2024-09-12 18:21:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:21:04,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:04,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 18:21:04,196 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 18:21:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:21:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:21:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:21:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:21:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 18:21:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:21:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:21:04,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:21:04,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:21:04,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:21:04,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:21:04,317 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:21:04,319 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:21:04,509 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-12 18:21:04,510 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:21:04,542 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:21:04,542 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 18:21:04,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:21:04 BoogieIcfgContainer [2024-09-12 18:21:04,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:21:04,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:21:04,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:21:04,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:21:04,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:21:03" (1/3) ... [2024-09-12 18:21:04,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd63630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:21:04, skipping insertion in model container [2024-09-12 18:21:04,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:21:04" (2/3) ... [2024-09-12 18:21:04,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd63630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:21:04, skipping insertion in model container [2024-09-12 18:21:04,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:21:04" (3/3) ... [2024-09-12 18:21:04,556 INFO L112 eAbstractionObserver]: Analyzing ICFG vnew2.c [2024-09-12 18:21:04,573 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:21:04,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-12 18:21:04,641 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:21:04,648 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;@6a1ae391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:21:04,649 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-12 18:21:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 18:21:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 18:21:04,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:04,662 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:04,662 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:04,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2123255605, now seen corresponding path program 1 times [2024-09-12 18:21:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999038062] [2024-09-12 18:21:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:04,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:04,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999038062] [2024-09-12 18:21:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999038062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:21:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400681548] [2024-09-12 18:21:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:05,004 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:21:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:21:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:21:05,029 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:05,157 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-09-12 18:21:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:21:05,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 18:21:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:05,169 INFO L225 Difference]: With dead ends: 42 [2024-09-12 18:21:05,170 INFO L226 Difference]: Without dead ends: 17 [2024-09-12 18:21:05,172 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:21:05,179 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:05,180 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:21:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-12 18:21:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-12 18:21:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-12 18:21:05,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2024-09-12 18:21:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:05,223 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-12 18:21:05,224 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-12 18:21:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:21:05,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:05,225 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:05,226 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:21:05,226 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:05,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1396414376, now seen corresponding path program 1 times [2024-09-12 18:21:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446400310] [2024-09-12 18:21:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:05,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:05,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446400310] [2024-09-12 18:21:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446400310] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:21:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337072603] [2024-09-12 18:21:05,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:05,387 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:21:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:21:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:21:05,389 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:05,448 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-09-12 18:21:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:21:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 18:21:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:05,450 INFO L225 Difference]: With dead ends: 17 [2024-09-12 18:21:05,450 INFO L226 Difference]: Without dead ends: 16 [2024-09-12 18:21:05,450 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:21:05,452 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:05,452 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-12 18:21:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-12 18:21:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-09-12 18:21:05,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-09-12 18:21:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:05,475 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-09-12 18:21:05,475 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-09-12 18:21:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:21:05,482 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:05,482 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:05,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:21:05,482 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:05,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1930776448, now seen corresponding path program 1 times [2024-09-12 18:21:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911761400] [2024-09-12 18:21:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:05,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911761400] [2024-09-12 18:21:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911761400] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:21:05,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:21:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:21:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728473958] [2024-09-12 18:21:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:21:05,689 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:21:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:21:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:21:05,692 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-12 18:21:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:05,780 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-09-12 18:21:05,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:21:05,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2024-09-12 18:21:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:05,783 INFO L225 Difference]: With dead ends: 26 [2024-09-12 18:21:05,783 INFO L226 Difference]: Without dead ends: 17 [2024-09-12 18:21:05,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:21:05,784 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:05,785 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:21:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-12 18:21:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-12 18:21:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-12 18:21:05,794 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2024-09-12 18:21:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:05,795 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-12 18:21:05,795 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-12 18:21:05,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-12 18:21:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 18:21:05,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:05,798 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:05,798 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:21:05,799 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:05,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 126626886, now seen corresponding path program 1 times [2024-09-12 18:21:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618130313] [2024-09-12 18:21:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:06,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:21:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:06,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618130313] [2024-09-12 18:21:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618130313] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:21:06,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724891459] [2024-09-12 18:21:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:06,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:06,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:21:06,621 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 18:21:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:06,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 18:21:06,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:06,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724891459] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:07,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:21:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-12 18:21:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883039675] [2024-09-12 18:21:07,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:07,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 18:21:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 18:21:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:21:07,086 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:07,403 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-09-12 18:21:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 18:21:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 18:21:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:07,405 INFO L225 Difference]: With dead ends: 26 [2024-09-12 18:21:07,405 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 18:21:07,406 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-09-12 18:21:07,407 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:07,407 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:21:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 18:21:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-09-12 18:21:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-09-12 18:21:07,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2024-09-12 18:21:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:07,425 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-09-12 18:21:07,425 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:07,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-09-12 18:21:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 18:21:07,427 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:07,427 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:07,445 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 18:21:07,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:07,632 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:07,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -382569822, now seen corresponding path program 1 times [2024-09-12 18:21:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543286073] [2024-09-12 18:21:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:21:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489637771] [2024-09-12 18:21:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:07,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:21:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 18:21:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:21:07,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 18:21:07,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:07,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:08,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543286073] [2024-09-12 18:21:08,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:21:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489637771] [2024-09-12 18:21:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489637771] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:08,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:21:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2024-09-12 18:21:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993837737] [2024-09-12 18:21:08,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:08,074 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 18:21:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 18:21:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:21:08,076 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:21:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:12,758 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2024-09-12 18:21:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 18:21:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-12 18:21:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:12,759 INFO L225 Difference]: With dead ends: 37 [2024-09-12 18:21:12,759 INFO L226 Difference]: Without dead ends: 20 [2024-09-12 18:21:12,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=103, Invalid=316, Unknown=1, NotChecked=0, Total=420 [2024-09-12 18:21:12,760 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:12,761 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 46 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 18:21:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-12 18:21:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-12 18:21:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-09-12 18:21:12,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2024-09-12 18:21:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:12,776 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-09-12 18:21:12,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:21:12,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-09-12 18:21:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:21:12,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:12,777 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:12,797 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 18:21:12,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:12,982 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:12,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash -281456420, now seen corresponding path program 2 times [2024-09-12 18:21:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718027332] [2024-09-12 18:21:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:21:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503285684] [2024-09-12 18:21:13,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:21:13,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:13,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:21:13,019 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 18:21:13,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:21:13,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:21:13,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-12 18:21:13,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:13,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718027332] [2024-09-12 18:21:13,722 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:21:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503285684] [2024-09-12 18:21:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503285684] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:13,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:21:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2024-09-12 18:21:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594496879] [2024-09-12 18:21:13,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:13,723 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 18:21:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 18:21:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-12 18:21:13,725 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:21:28,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 18:21:46,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-12 18:21:50,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 18:21:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:21:50,517 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-09-12 18:21:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 18:21:50,518 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-12 18:21:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:21:50,518 INFO L225 Difference]: With dead ends: 55 [2024-09-12 18:21:50,518 INFO L226 Difference]: Without dead ends: 26 [2024-09-12 18:21:50,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=340, Invalid=919, Unknown=1, NotChecked=0, Total=1260 [2024-09-12 18:21:50,520 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-09-12 18:21:50,520 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 67 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2024-09-12 18:21:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-12 18:21:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-12 18:21:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:21:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-09-12 18:21:50,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2024-09-12 18:21:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:21:50,533 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-09-12 18:21:50,533 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:21:50,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-09-12 18:21:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 18:21:50,534 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:21:50,535 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:21:50,554 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 18:21:50,738 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 18:21:50,739 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:21:50,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:21:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -712385764, now seen corresponding path program 3 times [2024-09-12 18:21:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:21:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341571542] [2024-09-12 18:21:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:21:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:21:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:21:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278516682] [2024-09-12 18:21:50,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 18:21:50,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:21:50,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:21:50,808 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:21:50,809 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 18:21:50,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-12 18:21:50,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:21:50,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-12 18:21:50,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:21:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:51,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:21:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:21:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:21:52,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341571542] [2024-09-12 18:21:52,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:21:52,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278516682] [2024-09-12 18:21:52,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278516682] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:21:52,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:21:52,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2024-09-12 18:21:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952511564] [2024-09-12 18:21:52,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:21:52,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-12 18:21:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:21:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-12 18:21:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2024-09-12 18:21:52,428 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:21:56,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (let ((.cse0 (mod (+ c_main_~i~0 24) 4294967296))) (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 1))) (let ((.cse2 (mod (+ c_main_~i~0 15) 4294967296))) (or (not (= (mod (mod .cse2 .cse1) 4294967296) 0)) (< .cse2 1))) (let ((.cse3 (mod (+ c_main_~i~0 27) 4294967296))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 1))) (let ((.cse4 (mod (+ c_main_~i~0 18) 4294967296))) (or (not (= (mod (mod .cse4 .cse1) 4294967296) 0)) (< .cse4 1))) (let ((.cse5 (mod (+ c_main_~i~0 30) 4294967296))) (or (< .cse5 1) (not (= (mod (mod .cse5 .cse1) 4294967296) 0)))) (let ((.cse6 (mod (+ c_main_~i~0 21) 4294967296))) (or (< .cse6 1) (not (= (mod (mod .cse6 .cse1) 4294967296) 0)))) (let ((.cse7 (mod (+ c_main_~i~0 9) 4294967296))) (or (< .cse7 1) (not (= (mod (mod .cse7 .cse1) 4294967296) 0)))) (let ((.cse8 (mod (+ c_main_~i~0 6) 4294967296))) (or (< .cse8 1) (not (= (mod (mod .cse8 .cse1) 4294967296) 0)))) (let ((.cse9 (mod (+ c_main_~i~0 3) 4294967296))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 1))) (= 20000001 c_~SIZE~0) (let ((.cse10 (mod (+ c_main_~i~0 12) 4294967296))) (or (< .cse10 1) (not (= (mod (mod .cse10 .cse1) 4294967296) 0)))) (not (= 0 (mod (mod (mod c_main_~i~0 4294967296) .cse1) 4294967296))))) is different from false [2024-09-12 18:22:13,091 WARN L293 SmtUtils]: Spent 14.66s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:22:41,325 WARN L293 SmtUtils]: Spent 27.71s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:23:00,988 WARN L293 SmtUtils]: Spent 18.65s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:23:05,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 18:23:13,093 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:23:40,653 WARN L293 SmtUtils]: Spent 25.52s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:23:57,460 WARN L293 SmtUtils]: Spent 16.25s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:24:03,217 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:24:15,274 WARN L293 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:24:23,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 18:24:44,076 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 18:24:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:24:50,769 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-09-12 18:24:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-12 18:24:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-12 18:24:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:24:50,770 INFO L225 Difference]: With dead ends: 91 [2024-09-12 18:24:50,770 INFO L226 Difference]: Without dead ends: 38 [2024-09-12 18:24:50,772 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 173.0s TimeCoverageRelationStatistics Valid=1093, Invalid=2942, Unknown=1, NotChecked=124, Total=4160 [2024-09-12 18:24:50,773 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 198 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-09-12 18:24:50,773 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 106 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 1 Unknown, 51 Unchecked, 6.3s Time] [2024-09-12 18:24:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-12 18:24:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-12 18:24:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:24:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-09-12 18:24:50,796 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 25 [2024-09-12 18:24:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:24:50,796 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-09-12 18:24:50,796 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:24:50,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-09-12 18:24:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 18:24:50,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:24:50,798 INFO L216 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:50,806 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 18:24:50,998 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:50,999 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:24:50,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:24:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1173151644, now seen corresponding path program 4 times [2024-09-12 18:24:50,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:24:50,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798703452] [2024-09-12 18:24:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:24:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:24:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:24:51,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473617706] [2024-09-12 18:24:51,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 18:24:51,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:24:51,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:24:51,085 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:24:51,086 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 18:24:51,184 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 18:24:51,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:24:51,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-12 18:24:51,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:24:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:51,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:24:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:24:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:24:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798703452] [2024-09-12 18:24:54,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:24:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473617706] [2024-09-12 18:24:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473617706] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:24:54,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 18:24:54,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 55 [2024-09-12 18:24:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509578942] [2024-09-12 18:24:54,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 18:24:54,517 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-09-12 18:24:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:24:54,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-09-12 18:24:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2024-09-12 18:24:54,520 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 53 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:24:59,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_main_~i~0 21) 4294967296)) (.cse7 (mod (+ c_main_~i~0 6) 4294967296)) (.cse6 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 63) 4294967296)) (.cse3 (mod (+ c_main_~i~0 24) 4294967296)) (.cse10 (mod (+ c_main_~i~0 45) 4294967296)) (.cse17 (mod (+ c_main_~i~0 27) 4294967296)) (.cse13 (mod (+ c_main_~i~0 30) 4294967296)) (.cse16 (mod (+ c_main_~i~0 51) 4294967296)) (.cse20 (mod (+ c_main_~i~0 48) 4294967296)) (.cse1 (mod (+ c_main_~i~0 60) 4294967296)) (.cse19 (mod (+ c_main_~i~0 36) 4294967296)) (.cse12 (mod (+ c_main_~i~0 33) 4294967296)) (.cse8 (mod (+ c_main_~i~0 3) 4294967296)) (.cse9 (mod (+ c_main_~i~0 12) 4294967296)) (.cse15 (mod (+ c_main_~i~0 54) 4294967296)) (.cse21 (mod (+ c_main_~i~0 57) 4294967296)) (.cse11 (mod (+ c_main_~i~0 42) 4294967296)) (.cse18 (mod (+ c_main_~i~0 39) 4294967296)) (.cse22 (mod c_main_~i~0 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse5 (mod (+ c_main_~i~0 18) 4294967296)) (.cse23 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (< .cse0 (+ .cse1 1)) (not (= (mod (mod .cse0 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (< .cse3 (+ 1 .cse4))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse2) 4294967296) 0))) (or (< .cse6 (+ .cse7 1)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0))) (or (< .cse7 (+ .cse8 1)) (not (= (mod (mod .cse7 .cse2) 4294967296) 0))) (or (< .cse9 (+ .cse6 1)) (not (= (mod (mod .cse9 .cse2) 4294967296) 0))) (or (< .cse10 (+ .cse11 1)) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (< .cse12 (+ .cse13 1))) (let ((.cse14 (mod (+ c_main_~i~0 66) 4294967296))) (or (< .cse14 (+ .cse0 1)) (not (= (mod (mod .cse14 .cse2) 4294967296) 0)))) (or (< .cse15 (+ .cse16 1)) (not (= (mod (mod .cse15 .cse2) 4294967296) 0))) (or (< .cse17 (+ .cse3 1)) (not (= (mod (mod .cse17 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (< .cse18 (+ .cse19 1))) (or (not (= (mod (mod .cse20 .cse2) 4294967296) 0)) (< .cse20 (+ .cse10 1))) (or (< .cse13 (+ .cse17 1)) (not (= (mod (mod .cse13 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse16 .cse2) 4294967296) 0)) (< .cse16 (+ .cse20 1))) (or (< .cse1 (+ .cse21 1)) (not (= (mod (mod .cse1 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (< .cse19 (+ .cse12 1))) (= 20000001 c_~SIZE~0) (or (not (= (mod (mod .cse8 .cse2) 4294967296) 0)) (< .cse8 (+ .cse22 1))) (or (< .cse23 (+ .cse9 1)) (not (= (mod (mod .cse23 .cse2) 4294967296) 0))) (or (< .cse21 (+ .cse15 1)) (not (= (mod (mod .cse21 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse11 .cse2) 4294967296) 0)) (< .cse11 (+ .cse18 1))) (not (= 0 (mod (mod .cse22 .cse2) 4294967296))) (or (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (< .cse5 (+ .cse23 1))))) is different from false [2024-09-12 18:25:03,959 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_main_~i~0 21) 4294967296)) (.cse7 (mod (+ c_main_~i~0 6) 4294967296)) (.cse6 (mod (+ c_main_~i~0 9) 4294967296)) (.cse3 (mod (+ c_main_~i~0 24) 4294967296)) (.cse10 (mod (+ c_main_~i~0 45) 4294967296)) (.cse16 (mod (+ c_main_~i~0 27) 4294967296)) (.cse13 (mod (+ c_main_~i~0 30) 4294967296)) (.cse15 (mod (+ c_main_~i~0 51) 4294967296)) (.cse19 (mod (+ c_main_~i~0 48) 4294967296)) (.cse1 (mod (+ c_main_~i~0 60) 4294967296)) (.cse18 (mod (+ c_main_~i~0 36) 4294967296)) (.cse12 (mod (+ c_main_~i~0 33) 4294967296)) (.cse8 (mod (+ c_main_~i~0 3) 4294967296)) (.cse21 (mod c_main_~i~0 4294967296)) (.cse9 (mod (+ c_main_~i~0 12) 4294967296)) (.cse14 (mod (+ c_main_~i~0 54) 4294967296)) (.cse20 (mod (+ c_main_~i~0 57) 4294967296)) (.cse11 (mod (+ c_main_~i~0 42) 4294967296)) (.cse17 (mod (+ c_main_~i~0 39) 4294967296)) (.cse2 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse5 (mod (+ c_main_~i~0 18) 4294967296)) (.cse22 (mod (+ c_main_~i~0 15) 4294967296))) (and (let ((.cse0 (mod (+ c_main_~i~0 63) 4294967296))) (or (< .cse0 (+ .cse1 1)) (not (= (mod (mod .cse0 .cse2) 4294967296) 0)))) (or (not (= (mod (mod .cse3 .cse2) 4294967296) 0)) (< .cse3 (+ 1 .cse4))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse2) 4294967296) 0))) (or (< .cse6 (+ .cse7 1)) (not (= (mod (mod .cse6 .cse2) 4294967296) 0))) (or (< .cse7 (+ .cse8 1)) (not (= (mod (mod .cse7 .cse2) 4294967296) 0))) (or (< .cse9 (+ .cse6 1)) (not (= (mod (mod .cse9 .cse2) 4294967296) 0))) (or (< .cse10 (+ .cse11 1)) (not (= (mod (mod .cse10 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse12 .cse2) 4294967296) 0)) (< .cse12 (+ .cse13 1))) (or (< .cse14 (+ .cse15 1)) (not (= (mod (mod .cse14 .cse2) 4294967296) 0))) (or (< .cse16 (+ .cse3 1)) (not (= (mod (mod .cse16 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse17 .cse2) 4294967296) 0)) (< .cse17 (+ .cse18 1))) (or (not (= (mod (mod .cse19 .cse2) 4294967296) 0)) (< .cse19 (+ .cse10 1))) (or (< .cse13 (+ .cse16 1)) (not (= (mod (mod .cse13 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse15 .cse2) 4294967296) 0)) (< .cse15 (+ .cse19 1))) (or (< .cse1 (+ .cse20 1)) (not (= (mod (mod .cse1 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse18 .cse2) 4294967296) 0)) (< .cse18 (+ .cse12 1))) (or (< .cse21 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse21 .cse2) 4294967296)))) (or (not (= (mod (mod .cse8 .cse2) 4294967296) 0)) (< .cse8 (+ .cse21 1))) (or (< .cse22 (+ .cse9 1)) (not (= (mod (mod .cse22 .cse2) 4294967296) 0))) (or (< .cse20 (+ .cse14 1)) (not (= (mod (mod .cse20 .cse2) 4294967296) 0))) (or (not (= (mod (mod .cse11 .cse2) 4294967296) 0)) (< .cse11 (+ .cse17 1))) (or (not (= (mod (mod .cse5 .cse2) 4294967296) 0)) (< .cse5 (+ .cse22 1))))) is different from false [2024-09-12 18:25:08,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse8 (mod (+ c_main_~i~0 45) 4294967296)) (.cse14 (mod (+ c_main_~i~0 27) 4294967296)) (.cse11 (mod (+ c_main_~i~0 30) 4294967296)) (.cse13 (mod (+ c_main_~i~0 51) 4294967296)) (.cse17 (mod (+ c_main_~i~0 48) 4294967296)) (.cse16 (mod (+ c_main_~i~0 36) 4294967296)) (.cse10 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse20 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse12 (mod (+ c_main_~i~0 54) 4294967296)) (.cse19 (mod (+ c_main_~i~0 57) 4294967296)) (.cse9 (mod (+ c_main_~i~0 42) 4294967296)) (.cse15 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse21 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (< .cse8 (+ .cse9 1)) (not (= (mod (mod .cse8 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (< .cse10 (+ .cse11 1))) (or (< .cse12 (+ .cse13 1)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0))) (or (< .cse14 (+ .cse0 1)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (< .cse15 (+ .cse16 1))) (or (not (= (mod (mod .cse17 .cse1) 4294967296) 0)) (< .cse17 (+ .cse8 1))) (or (< .cse11 (+ .cse14 1)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse13 .cse1) 4294967296) 0)) (< .cse13 (+ .cse17 1))) (let ((.cse18 (mod (+ c_main_~i~0 60) 4294967296))) (or (< .cse18 (+ .cse19 1)) (not (= (mod (mod .cse18 .cse1) 4294967296) 0)))) (or (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (< .cse16 (+ .cse10 1))) (or (< .cse20 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse20 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse20 1))) (or (< .cse21 (+ .cse7 1)) (not (= (mod (mod .cse21 .cse1) 4294967296) 0))) (or (< .cse19 (+ .cse12 1)) (not (= (mod (mod .cse19 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 (+ .cse15 1))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse21 1))))) is different from false [2024-09-12 18:25:12,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse8 (mod (+ c_main_~i~0 45) 4294967296)) (.cse14 (mod (+ c_main_~i~0 27) 4294967296)) (.cse11 (mod (+ c_main_~i~0 30) 4294967296)) (.cse13 (mod (+ c_main_~i~0 51) 4294967296)) (.cse17 (mod (+ c_main_~i~0 48) 4294967296)) (.cse16 (mod (+ c_main_~i~0 36) 4294967296)) (.cse10 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse18 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse12 (mod (+ c_main_~i~0 54) 4294967296)) (.cse9 (mod (+ c_main_~i~0 42) 4294967296)) (.cse15 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse19 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (< .cse8 (+ .cse9 1)) (not (= (mod (mod .cse8 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (< .cse10 (+ .cse11 1))) (or (< .cse12 (+ .cse13 1)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0))) (or (< .cse14 (+ .cse0 1)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (< .cse15 (+ .cse16 1))) (or (not (= (mod (mod .cse17 .cse1) 4294967296) 0)) (< .cse17 (+ .cse8 1))) (or (< .cse11 (+ .cse14 1)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse13 .cse1) 4294967296) 0)) (< .cse13 (+ .cse17 1))) (or (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (< .cse16 (+ .cse10 1))) (or (< .cse18 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse18 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse18 1))) (or (< .cse19 (+ .cse7 1)) (not (= (mod (mod .cse19 .cse1) 4294967296) 0))) (let ((.cse20 (mod (+ c_main_~i~0 57) 4294967296))) (or (< .cse20 (+ .cse12 1)) (not (= (mod (mod .cse20 .cse1) 4294967296) 0)))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 (+ .cse15 1))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse19 1))))) is different from false [2024-09-12 18:25:16,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse8 (mod (+ c_main_~i~0 45) 4294967296)) (.cse14 (mod (+ c_main_~i~0 27) 4294967296)) (.cse11 (mod (+ c_main_~i~0 30) 4294967296)) (.cse13 (mod (+ c_main_~i~0 51) 4294967296)) (.cse17 (mod (+ c_main_~i~0 48) 4294967296)) (.cse16 (mod (+ c_main_~i~0 36) 4294967296)) (.cse10 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse18 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse9 (mod (+ c_main_~i~0 42) 4294967296)) (.cse15 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse19 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (< .cse8 (+ .cse9 1)) (not (= (mod (mod .cse8 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (< .cse10 (+ .cse11 1))) (let ((.cse12 (mod (+ c_main_~i~0 54) 4294967296))) (or (< .cse12 (+ .cse13 1)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0)))) (or (< .cse14 (+ .cse0 1)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (< .cse15 (+ .cse16 1))) (or (not (= (mod (mod .cse17 .cse1) 4294967296) 0)) (< .cse17 (+ .cse8 1))) (or (< .cse11 (+ .cse14 1)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse13 .cse1) 4294967296) 0)) (< .cse13 (+ .cse17 1))) (or (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (< .cse16 (+ .cse10 1))) (or (< .cse18 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse18 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse18 1))) (or (< .cse19 (+ .cse7 1)) (not (= (mod (mod .cse19 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 (+ .cse15 1))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse19 1))))) is different from false [2024-09-12 18:25:21,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse8 (mod (+ c_main_~i~0 45) 4294967296)) (.cse12 (mod (+ c_main_~i~0 27) 4294967296)) (.cse11 (mod (+ c_main_~i~0 30) 4294967296)) (.cse15 (mod (+ c_main_~i~0 48) 4294967296)) (.cse14 (mod (+ c_main_~i~0 36) 4294967296)) (.cse10 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse17 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse9 (mod (+ c_main_~i~0 42) 4294967296)) (.cse13 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse18 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (< .cse8 (+ .cse9 1)) (not (= (mod (mod .cse8 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (< .cse10 (+ .cse11 1))) (or (< .cse12 (+ .cse0 1)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse13 .cse1) 4294967296) 0)) (< .cse13 (+ .cse14 1))) (or (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (< .cse15 (+ .cse8 1))) (or (< .cse11 (+ .cse12 1)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0))) (let ((.cse16 (mod (+ c_main_~i~0 51) 4294967296))) (or (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (< .cse16 (+ .cse15 1)))) (or (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (< .cse14 (+ .cse10 1))) (or (< .cse17 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse17 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse17 1))) (or (< .cse18 (+ .cse7 1)) (not (= (mod (mod .cse18 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 (+ .cse13 1))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse18 1))))) is different from false [2024-09-12 18:25:25,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse8 (mod (+ c_main_~i~0 45) 4294967296)) (.cse12 (mod (+ c_main_~i~0 27) 4294967296)) (.cse11 (mod (+ c_main_~i~0 30) 4294967296)) (.cse14 (mod (+ c_main_~i~0 36) 4294967296)) (.cse10 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse16 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse9 (mod (+ c_main_~i~0 42) 4294967296)) (.cse13 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse17 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (< .cse8 (+ .cse9 1)) (not (= (mod (mod .cse8 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (< .cse10 (+ .cse11 1))) (or (< .cse12 (+ .cse0 1)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse13 .cse1) 4294967296) 0)) (< .cse13 (+ .cse14 1))) (let ((.cse15 (mod (+ c_main_~i~0 48) 4294967296))) (or (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (< .cse15 (+ .cse8 1)))) (or (< .cse11 (+ .cse12 1)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (< .cse14 (+ .cse10 1))) (or (< .cse16 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse16 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse16 1))) (or (< .cse17 (+ .cse7 1)) (not (= (mod (mod .cse17 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 (+ .cse13 1))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse17 1))))) is different from false [2024-09-12 18:25:29,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse12 (mod (+ c_main_~i~0 27) 4294967296)) (.cse11 (mod (+ c_main_~i~0 30) 4294967296)) (.cse14 (mod (+ c_main_~i~0 36) 4294967296)) (.cse10 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse15 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse9 (mod (+ c_main_~i~0 42) 4294967296)) (.cse13 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse16 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (let ((.cse8 (mod (+ c_main_~i~0 45) 4294967296))) (or (< .cse8 (+ .cse9 1)) (not (= (mod (mod .cse8 .cse1) 4294967296) 0)))) (or (not (= (mod (mod .cse10 .cse1) 4294967296) 0)) (< .cse10 (+ .cse11 1))) (or (< .cse12 (+ .cse0 1)) (not (= (mod (mod .cse12 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse13 .cse1) 4294967296) 0)) (< .cse13 (+ .cse14 1))) (or (< .cse11 (+ .cse12 1)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (< .cse14 (+ .cse10 1))) (or (< .cse15 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse15 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse15 1))) (or (< .cse16 (+ .cse7 1)) (not (= (mod (mod .cse16 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (< .cse9 (+ .cse13 1))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse16 1))))) is different from false [2024-09-12 18:25:33,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse9 (mod (+ c_main_~i~0 30) 4294967296)) (.cse12 (mod (+ c_main_~i~0 36) 4294967296)) (.cse8 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse13 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse11 (mod (+ c_main_~i~0 39) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse14 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse8 .cse1) 4294967296) 0)) (< .cse8 (+ .cse9 1))) (or (< .cse10 (+ .cse0 1)) (not (= (mod (mod .cse10 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse11 .cse1) 4294967296) 0)) (< .cse11 (+ .cse12 1))) (or (< .cse9 (+ .cse10 1)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse12 .cse1) 4294967296) 0)) (< .cse12 (+ .cse8 1))) (or (< .cse13 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse13 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse13 1))) (or (< .cse14 (+ .cse7 1)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0))) (let ((.cse15 (mod (+ c_main_~i~0 42) 4294967296))) (or (not (= (mod (mod .cse15 .cse1) 4294967296) 0)) (< .cse15 (+ .cse11 1)))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse14 1))))) is different from false [2024-09-12 18:25:37,466 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ c_main_~i~0 21) 4294967296)) (.cse5 (mod (+ c_main_~i~0 6) 4294967296)) (.cse4 (mod (+ c_main_~i~0 9) 4294967296)) (.cse0 (mod (+ c_main_~i~0 24) 4294967296)) (.cse10 (mod (+ c_main_~i~0 27) 4294967296)) (.cse9 (mod (+ c_main_~i~0 30) 4294967296)) (.cse12 (mod (+ c_main_~i~0 36) 4294967296)) (.cse8 (mod (+ c_main_~i~0 33) 4294967296)) (.cse6 (mod (+ c_main_~i~0 3) 4294967296)) (.cse13 (mod c_main_~i~0 4294967296)) (.cse7 (mod (+ c_main_~i~0 12) 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296)) (.cse3 (mod (+ c_main_~i~0 18) 4294967296)) (.cse14 (mod (+ c_main_~i~0 15) 4294967296))) (and (or (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (< .cse0 (+ 1 .cse2))) (or (< .cse2 (+ .cse3 1)) (not (= (mod (mod .cse2 .cse1) 4294967296) 0))) (or (< .cse4 (+ .cse5 1)) (not (= (mod (mod .cse4 .cse1) 4294967296) 0))) (or (< .cse5 (+ .cse6 1)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0))) (or (< .cse7 (+ .cse4 1)) (not (= (mod (mod .cse7 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse8 .cse1) 4294967296) 0)) (< .cse8 (+ .cse9 1))) (or (< .cse10 (+ .cse0 1)) (not (= (mod (mod .cse10 .cse1) 4294967296) 0))) (let ((.cse11 (mod (+ c_main_~i~0 39) 4294967296))) (or (not (= (mod (mod .cse11 .cse1) 4294967296) 0)) (< .cse11 (+ .cse12 1)))) (or (< .cse9 (+ .cse10 1)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse12 .cse1) 4294967296) 0)) (< .cse12 (+ .cse8 1))) (or (< .cse13 (mod c_main_~n~0 4294967296)) (not (= 0 (mod (mod .cse13 .cse1) 4294967296)))) (or (not (= (mod (mod .cse6 .cse1) 4294967296) 0)) (< .cse6 (+ .cse13 1))) (or (< .cse14 (+ .cse7 1)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0))) (or (not (= (mod (mod .cse3 .cse1) 4294967296) 0)) (< .cse3 (+ .cse14 1))))) is different from false