./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/jain_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/jain_5-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd --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 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:22:25,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:22:25,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:22:25,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:22:25,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:22:25,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:22:25,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:22:25,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:22:25,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:22:25,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:22:25,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:22:25,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:22:25,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:22:25,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:22:25,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:22:25,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:22:25,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:22:25,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:22:25,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:22:25,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:22:25,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:22:25,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:22:25,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:22:25,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:22:25,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:22:25,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:22:25,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:22:25,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:22:25,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:22:25,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:22:25,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:22:25,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:22:25,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:22:25,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:22:25,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:22:25,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:22:25,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:22:25,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:22:25,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:22:25,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:22:25,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:22:25,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:22:25,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd 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 -> 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e [2024-11-13 16:22:25,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:22:25,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:22:25,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:22:25,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:22:25,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:22:25,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/bitvector/jain_5-2.c Unable to find full path for "g++" [2024-11-13 16:22:28,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:22:28,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:22:28,336 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/sv-benchmarks/c/bitvector/jain_5-2.c [2024-11-13 16:22:28,349 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/data/b6f0412eb/6f74962d488948e980e8b0671cbe5d5d/FLAGd5345e3a8 [2024-11-13 16:22:28,383 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/data/b6f0412eb/6f74962d488948e980e8b0671cbe5d5d [2024-11-13 16:22:28,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:22:28,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:22:28,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:22:28,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:22:28,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:22:28,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f9d51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28, skipping insertion in model container [2024-11-13 16:22:28,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:22:28,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2024-11-13 16:22:28,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:22:28,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:22:28,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2024-11-13 16:22:28,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:22:28,747 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:22:28,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28 WrapperNode [2024-11-13 16:22:28,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:22:28,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:22:28,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:22:28,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:22:28,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,790 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2024-11-13 16:22:28,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:22:28,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:22:28,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:22:28,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:22:28,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 16:22:28,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:22:28,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:22:28,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:22:28,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:22:28,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (1/1) ... [2024-11-13 16:22:28,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:22:28,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:22:28,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:22:28,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:22:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:22:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:22:28,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:22:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:22:29,012 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:22:29,014 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:22:29,109 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-13 16:22:29,109 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:22:29,121 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:22:29,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:22:29,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:22:29 BoogieIcfgContainer [2024-11-13 16:22:29,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:22:29,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:22:29,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:22:29,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:22:29,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:22:28" (1/3) ... [2024-11-13 16:22:29,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40656232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:22:29, skipping insertion in model container [2024-11-13 16:22:29,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:22:28" (2/3) ... [2024-11-13 16:22:29,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40656232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:22:29, skipping insertion in model container [2024-11-13 16:22:29,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:22:29" (3/3) ... [2024-11-13 16:22:29,138 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2024-11-13 16:22:29,157 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:22:29,160 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG jain_5-2.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:22:29,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:22:29,257 INFO L333 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=LoopHeads, 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;@18df0f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:22:29,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:22:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 16:22:29,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:22:29,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 16:22:29,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:22:29,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:22:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2024-11-13 16:22:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:22:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199754463] [2024-11-13 16:22:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:22:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:22:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:22:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:22:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199754463] [2024-11-13 16:22:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199754463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:22:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:22:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:22:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345733283] [2024-11-13 16:22:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:22:29,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:22:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:22:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:22:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:22:29,724 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:22:29,777 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2024-11-13 16:22:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:22:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-13 16:22:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:22:29,791 INFO L225 Difference]: With dead ends: 18 [2024-11-13 16:22:29,792 INFO L226 Difference]: Without dead ends: 9 [2024-11-13 16:22:29,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:22:29,800 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:22:29,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:22:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-13 16:22:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-13 16:22:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-13 16:22:29,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-13 16:22:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:22:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-13 16:22:29,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-13 16:22:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 16:22:29,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:22:29,843 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-13 16:22:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:22:29,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:22:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:22:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash 271103426, now seen corresponding path program 1 times [2024-11-13 16:22:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:22:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052777239] [2024-11-13 16:22:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:22:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:22:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:22:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:22:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052777239] [2024-11-13 16:22:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052777239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:22:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377882135] [2024-11-13 16:22:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:22:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:22:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:22:30,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:22:30,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:22:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:22:30,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 16:22:30,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:22:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:30,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:22:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377882135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:22:30,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:22:30,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-13 16:22:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155741454] [2024-11-13 16:22:30,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:22:30,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:22:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:22:30,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:22:30,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:22:30,554 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:22:30,754 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-13 16:22:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:22:30,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-13 16:22:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:22:30,755 INFO L225 Difference]: With dead ends: 20 [2024-11-13 16:22:30,756 INFO L226 Difference]: Without dead ends: 18 [2024-11-13 16:22:30,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:22:30,757 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:22:30,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:22:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-13 16:22:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-13 16:22:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-13 16:22:30,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2024-11-13 16:22:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:22:30,767 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-13 16:22:30,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-13 16:22:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 16:22:30,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:22:30,768 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-13 16:22:30,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 16:22:30,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-13 16:22:30,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:22:30,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:22:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -853085367, now seen corresponding path program 2 times [2024-11-13 16:22:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:22:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488137902] [2024-11-13 16:22:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:22:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:22:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:22:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:22:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488137902] [2024-11-13 16:22:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488137902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:22:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74251709] [2024-11-13 16:22:31,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:22:31,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:22:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:22:31,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:22:31,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:22:31,441 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:22:31,442 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:22:31,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 16:22:31,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:22:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:31,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:22:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74251709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:22:32,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:22:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2024-11-13 16:22:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472925621] [2024-11-13 16:22:32,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:22:32,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 16:22:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:22:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 16:22:32,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:22:32,229 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:22:34,757 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-13 16:22:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 16:22:34,758 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-13 16:22:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:22:34,759 INFO L225 Difference]: With dead ends: 38 [2024-11-13 16:22:34,759 INFO L226 Difference]: Without dead ends: 36 [2024-11-13 16:22:34,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2024-11-13 16:22:34,762 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:22:34,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:22:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-13 16:22:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-13 16:22:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-13 16:22:34,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2024-11-13 16:22:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:22:34,779 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-11-13 16:22:34,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-13 16:22:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 16:22:34,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:22:34,782 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2024-11-13 16:22:34,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:22:34,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:22:34,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:22:34,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:22:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash -398817431, now seen corresponding path program 3 times [2024-11-13 16:22:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:22:34,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705659240] [2024-11-13 16:22:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:22:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:22:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:22:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:22:35,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705659240] [2024-11-13 16:22:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705659240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:22:35,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893179465] [2024-11-13 16:22:35,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:22:35,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:22:35,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:22:35,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:22:35,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:22:36,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-13 16:22:36,064 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:22:36,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 16:22:36,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:22:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:36,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:22:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893179465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:22:37,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:22:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 38 [2024-11-13 16:22:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129163108] [2024-11-13 16:22:37,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:22:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 16:22:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:22:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 16:22:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 16:22:37,681 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:22:42,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) .cse0) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) .cse2) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse2) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse1) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:22:46,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30))) (and (not .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) .cse0) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse1) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:23:52,267 WARN L286 SmtUtils]: Spent 50.42s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:23:56,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:23:59,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:24:03,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296)))) (and (not .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) .cse0) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:24:24,157 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 62 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:24:27,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:01,441 WARN L286 SmtUtils]: Spent 25.46s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:25:02,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:07,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:11,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:28,908 WARN L286 SmtUtils]: Spent 12.80s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:25:32,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:34,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:38,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:53,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:25:57,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:26:08,352 WARN L286 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:26:20,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:26:24,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:26:45,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:26:46,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:27:00,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:27:05,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:27:07,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:27:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:07,366 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-13 16:27:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 16:27:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-13 16:27:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:27:07,370 INFO L225 Difference]: With dead ends: 71 [2024-11-13 16:27:07,370 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 16:27:07,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 208.8s TimeCoverageRelationStatistics Valid=877, Invalid=3025, Unknown=16, NotChecked=372, Total=4290 [2024-11-13 16:27:07,374 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 19 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 62.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:27:07,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 454 Invalid, 11 Unknown, 137 Unchecked, 62.0s Time] [2024-11-13 16:27:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 16:27:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 16:27:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2024-11-13 16:27:07,392 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 35 [2024-11-13 16:27:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:27:07,393 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2024-11-13 16:27:07,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2024-11-13 16:27:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 16:27:07,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:27:07,395 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2024-11-13 16:27:07,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:27:07,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:07,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:27:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1003493374, now seen corresponding path program 4 times [2024-11-13 16:27:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130184111] [2024-11-13 16:27:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:09,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130184111] [2024-11-13 16:27:09,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130184111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:27:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576101180] [2024-11-13 16:27:09,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 16:27:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:27:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:09,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:27:09,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_100b527b-b176-4677-98a2-1506af356512/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:27:09,482 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 16:27:09,482 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:27:09,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-13 16:27:09,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:27:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:10,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:27:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:31,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576101180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:27:31,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:27:31,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 71 [2024-11-13 16:27:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958320799] [2024-11-13 16:27:31,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:27:31,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-13 16:27:31,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-13 16:27:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=4153, Unknown=0, NotChecked=0, Total=4970 [2024-11-13 16:27:31,688 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 71 states, 71 states have (on average 2.788732394366197) internal successors, (198), 71 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:37,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse2 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse1) (not .cse2) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (or .cse4 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse5) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse6) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7) (or .cse5 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or .cse8 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 924 (* |c_ULTIMATE.start_main_~y~0#1| 22)) 4294967296)))) (not .cse8) (or .cse0 (not (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296)))) (not .cse4) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not .cse3) (not .cse6) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse2))) is different from false [2024-11-13 16:27:41,177 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse6 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not .cse0) (not .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse1) (not .cse3) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (or .cse5 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse6) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse7) (not .cse8) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse8) (or .cse6 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (or .cse0 (not (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296)))) (not .cse5) (not .cse2) (not .cse4) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse3))) is different from false [2024-11-13 16:27:45,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse6 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not .cse3) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (or .cse5 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse1) (not .cse6) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse7) (not .cse8) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse8) (or .cse6 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not .cse5) (not .cse2) (not .cse4) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse3))) is different from false [2024-11-13 16:27:49,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse2 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or .cse1 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not .cse2) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (or .cse4 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse5) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse6) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7) (or .cse5 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not .cse4) (not .cse1) (not .cse3) (not .cse6) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse2))) is different from false [2024-11-13 16:27:53,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (or .cse4 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse1) (not .cse5) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse6) (not .cse7) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7) (or .cse5 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not .cse4) (not .cse2) (not .cse3) (not .cse6))) is different from false [2024-11-13 16:27:57,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse4 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or .cse1 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse2) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (or .cse3 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse4) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse5) (not .cse6) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6) (or .cse4 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not .cse3) (not .cse1) (not .cse2) (not .cse5))) is different from false [2024-11-13 16:28:01,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse5 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (or .cse4 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse1) (not .cse5) (not .cse6) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6) (or .cse5 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not .cse4) (not .cse2) (not .cse3) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:05,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse4 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or .cse1 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse2) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (or .cse3 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (not .cse4) (not .cse5) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse5) (or .cse4 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not .cse3) (not .cse1) (not .cse2) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:09,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse4 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not .cse1) (not .cse4) (not .cse5) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse5) (or .cse4 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse2) (not .cse3) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:13,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse3 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or .cse1 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse2) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (not .cse3) (not .cse4) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse4) (or .cse3 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse1) (not .cse2) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:17,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse3) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse4) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse4) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse2) (not .cse3) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:21,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or .cse1 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse2) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse3) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse3) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse1) (not .cse2) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:25,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or .cse2 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse3) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse3) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse2) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:29,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or .cse1 (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30))) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse2) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse2) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not .cse1) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:33,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse2) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse2) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:37,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse1) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:41,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) .cse1) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not .cse1) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:28:45,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296)))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not .cse0) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) .cse0) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)))) is different from false [2024-11-13 16:32:57,409 WARN L286 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 89 DAG size of output: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:33:01,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:33:05,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:33:09,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:33:13,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:33:17,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:33:21,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:33:24,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []