/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 15:16:47,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:16:47,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:16:47,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:16:47,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:16:47,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:16:47,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:16:47,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:16:47,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:16:47,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:16:47,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:16:47,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:16:47,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:16:47,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:16:47,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:16:47,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:16:47,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:16:47,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:16:47,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:16:47,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:16:47,513 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:16:47,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:16:47,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:16:47,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:16:47,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:16:47,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:16:47,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:16:47,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:16:47,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:16:47,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:16:47,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:16:47,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:16:47,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:16:47,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:16:47,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:16:47,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:16:47,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:16:47,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:16:47,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:16:47,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:16:47,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:16:47,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:16:47,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:16:47,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:16:47,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:16:47,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:16:47,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:16:47,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:16:47,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:16:47,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:16:47,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:16:47,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:16:47,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:16:47,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:16:47,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:16:47,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:16:47,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:16:47,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:16:47,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:16:47,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:16:47,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:16:47,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:16:47,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:16:47,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:16:47,545 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:16:47,545 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 15:16:47,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:16:47,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:16:47,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:16:47,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:16:47,731 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:16:47,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-03-17 15:16:47,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c17b7952d/fa307712598a47108214a8a262065b9b/FLAG8bbefe2c4 [2022-03-17 15:16:48,145 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:16:48,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-03-17 15:16:48,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c17b7952d/fa307712598a47108214a8a262065b9b/FLAG8bbefe2c4 [2022-03-17 15:16:48,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c17b7952d/fa307712598a47108214a8a262065b9b [2022-03-17 15:16:48,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:16:48,569 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:16:48,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:16:48,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:16:48,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:16:48,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d25b1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48, skipping insertion in model container [2022-03-17 15:16:48,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:16:48,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:16:48,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-03-17 15:16:48,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:16:48,729 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:16:48,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-03-17 15:16:48,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:16:48,745 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:16:48,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48 WrapperNode [2022-03-17 15:16:48,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:16:48,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:16:48,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:16:48,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:16:48,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:16:48,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:16:48,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:16:48,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:16:48,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:16:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:16:48,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 15:16:48,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 15:16:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:16:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:16:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:16:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:16:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:16:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:16:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:16:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:16:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:16:48,843 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:16:48,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:16:48,915 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:16:48,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:16:48,918 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-17 15:16:48,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:16:48 BoogieIcfgContainer [2022-03-17 15:16:48,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:16:48,920 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:16:48,920 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:16:48,921 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:16:48,922 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:16:48" (1/1) ... [2022-03-17 15:16:48,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:16:48 BasicIcfg [2022-03-17 15:16:48,931 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:16:48,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:16:48,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:16:48,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:16:48,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:16:48" (1/4) ... [2022-03-17 15:16:48,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c18b6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:48, skipping insertion in model container [2022-03-17 15:16:48,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:16:48" (2/4) ... [2022-03-17 15:16:48,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c18b6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:16:48, skipping insertion in model container [2022-03-17 15:16:48,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:16:48" (3/4) ... [2022-03-17 15:16:48,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c18b6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:16:48, skipping insertion in model container [2022-03-17 15:16:48,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:16:48" (4/4) ... [2022-03-17 15:16:48,946 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.cJordan [2022-03-17 15:16:48,949 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:16:48,950 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:16:48,974 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:16:48,979 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-17 15:16:48,979 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:16:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 15:16:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-17 15:16:48,997 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:16:48,998 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:16:48,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:16:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:16:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-03-17 15:16:49,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:16:49,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829641953] [2022-03-17 15:16:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:16:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:16:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:16:49,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829641953] [2022-03-17 15:16:49,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829641953] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:16:49,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:16:49,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:16:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558736643] [2022-03-17 15:16:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:16:49,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:16:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:16:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:16:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:16:49,192 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:16:49,229 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-03-17 15:16:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:16:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-17 15:16:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:16:49,244 INFO L225 Difference]: With dead ends: 21 [2022-03-17 15:16:49,245 INFO L226 Difference]: Without dead ends: 14 [2022-03-17 15:16:49,246 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:16:49,250 INFO L912 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:16:49,251 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:16:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-03-17 15:16:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-03-17 15:16:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-03-17 15:16:49,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-03-17 15:16:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:16:49,273 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-03-17 15:16:49,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-03-17 15:16:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-17 15:16:49,275 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:16:49,275 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:16:49,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:16:49,275 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:16:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:16:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-03-17 15:16:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:16:49,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114315887] [2022-03-17 15:16:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:16:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:16:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:16:49,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114315887] [2022-03-17 15:16:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114315887] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:16:49,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:16:49,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 15:16:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044812171] [2022-03-17 15:16:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:16:49,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 15:16:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:16:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 15:16:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 15:16:49,443 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:16:49,484 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-03-17 15:16:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 15:16:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-17 15:16:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:16:49,486 INFO L225 Difference]: With dead ends: 17 [2022-03-17 15:16:49,486 INFO L226 Difference]: Without dead ends: 17 [2022-03-17 15:16:49,489 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-17 15:16:49,490 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:16:49,491 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:16:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-17 15:16:49,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-03-17 15:16:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-03-17 15:16:49,501 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-03-17 15:16:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:16:49,502 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-03-17 15:16:49,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-03-17 15:16:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-17 15:16:49,503 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:16:49,504 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:16:49,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:16:49,505 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:16:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:16:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-03-17 15:16:49,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:16:49,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145939210] [2022-03-17 15:16:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:16:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:16:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:16:49,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145939210] [2022-03-17 15:16:49,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145939210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:16:49,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462654563] [2022-03-17 15:16:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:16:49,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:16:49,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:16:49,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 15:16:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:49,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 15:16:49,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:16:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:49,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:16:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:49,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462654563] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:16:49,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:16:49,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-03-17 15:16:49,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121860007] [2022-03-17 15:16:49,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:16:49,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 15:16:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:16:49,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 15:16:49,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-03-17 15:16:49,866 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:16:50,032 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-03-17 15:16:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:16:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-03-17 15:16:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:16:50,033 INFO L225 Difference]: With dead ends: 31 [2022-03-17 15:16:50,033 INFO L226 Difference]: Without dead ends: 27 [2022-03-17 15:16:50,033 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:16:50,034 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:16:50,034 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 15:16:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-17 15:16:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-03-17 15:16:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-03-17 15:16:50,037 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-03-17 15:16:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:16:50,037 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-03-17 15:16:50,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-03-17 15:16:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 15:16:50,038 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:16:50,038 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:16:50,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 15:16:50,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:16:50,247 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:16:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:16:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -691789689, now seen corresponding path program 1 times [2022-03-17 15:16:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:16:50,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258803671] [2022-03-17 15:16:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:16:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:16:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:16:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:16:50,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258803671] [2022-03-17 15:16:50,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258803671] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:16:50,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138526139] [2022-03-17 15:16:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:50,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:16:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:16:50,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:16:50,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 15:16:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:50,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:16:50,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:16:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:16:50,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:16:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:16:50,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138526139] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:16:50,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:16:50,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-17 15:16:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194099396] [2022-03-17 15:16:50,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:16:50,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 15:16:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:16:50,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 15:16:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-17 15:16:50,560 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:16:50,705 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-03-17 15:16:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:16:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-03-17 15:16:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:16:50,707 INFO L225 Difference]: With dead ends: 34 [2022-03-17 15:16:50,707 INFO L226 Difference]: Without dead ends: 34 [2022-03-17 15:16:50,708 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-03-17 15:16:50,708 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:16:50,709 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 15:16:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-17 15:16:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-03-17 15:16:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-03-17 15:16:50,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-03-17 15:16:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:16:50,712 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-03-17 15:16:50,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-03-17 15:16:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-17 15:16:50,713 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:16:50,713 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:16:50,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-17 15:16:50,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-17 15:16:50,924 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:16:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:16:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-03-17 15:16:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:16:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348426303] [2022-03-17 15:16:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:16:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:16:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:51,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:16:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348426303] [2022-03-17 15:16:51,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348426303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:16:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465341516] [2022-03-17 15:16:51,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:16:51,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:16:51,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:16:51,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:16:51,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-17 15:16:51,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-17 15:16:51,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:16:51,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:16:51,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:16:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-03-17 15:16:51,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:16:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465341516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:16:51,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:16:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-03-17 15:16:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401884080] [2022-03-17 15:16:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:16:51,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 15:16:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:16:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 15:16:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:16:51,173 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:16:51,201 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-03-17 15:16:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:16:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-03-17 15:16:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:16:51,202 INFO L225 Difference]: With dead ends: 37 [2022-03-17 15:16:51,202 INFO L226 Difference]: Without dead ends: 34 [2022-03-17 15:16:51,202 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:16:51,203 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:16:51,203 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:16:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-17 15:16:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-03-17 15:16:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-03-17 15:16:51,206 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-03-17 15:16:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:16:51,206 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-03-17 15:16:51,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-03-17 15:16:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-17 15:16:51,207 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:16:51,207 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:16:51,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-17 15:16:51,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:16:51,420 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:16:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:16:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1647316777, now seen corresponding path program 2 times [2022-03-17 15:16:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:16:51,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089202675] [2022-03-17 15:16:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:16:51,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:16:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:16:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:16:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:51,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:16:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089202675] [2022-03-17 15:16:51,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089202675] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:16:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824960096] [2022-03-17 15:16:51,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:16:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:16:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:16:51,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:16:51,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-17 15:16:51,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:16:51,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:16:51,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-17 15:16:51,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:16:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:16:51,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:16:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:16:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824960096] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:16:52,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:16:52,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-03-17 15:16:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395549344] [2022-03-17 15:16:52,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:16:52,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-17 15:16:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:16:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-17 15:16:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-03-17 15:16:52,068 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:16:56,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:16:58,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:17:00,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:17:04,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:17:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:17:09,377 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2022-03-17 15:17:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-17 15:17:09,377 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-03-17 15:17:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:17:09,378 INFO L225 Difference]: With dead ends: 104 [2022-03-17 15:17:09,378 INFO L226 Difference]: Without dead ends: 95 [2022-03-17 15:17:09,379 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=549, Invalid=2313, Unknown=0, NotChecked=0, Total=2862 [2022-03-17 15:17:09,379 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-03-17 15:17:09,379 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 88 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 517 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2022-03-17 15:17:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-17 15:17:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-03-17 15:17:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-03-17 15:17:09,385 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 32 [2022-03-17 15:17:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:17:09,385 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-03-17 15:17:09,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-03-17 15:17:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-17 15:17:09,385 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:17:09,386 INFO L500 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:17:09,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-17 15:17:09,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:09,586 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:17:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:17:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -784123847, now seen corresponding path program 3 times [2022-03-17 15:17:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:17:09,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461146916] [2022-03-17 15:17:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:17:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:17:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:17:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:17:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:17:09,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461146916] [2022-03-17 15:17:09,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461146916] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:17:09,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742534246] [2022-03-17 15:17:09,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 15:17:09,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:09,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:17:09,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:17:09,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-17 15:17:09,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-17 15:17:09,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:17:09,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:17:09,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:17:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-03-17 15:17:09,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:17:09,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742534246] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:17:09,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:17:09,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-03-17 15:17:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432009687] [2022-03-17 15:17:09,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:17:09,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 15:17:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:17:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 15:17:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:17:09,944 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:17:09,978 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2022-03-17 15:17:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:17:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-03-17 15:17:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:17:09,994 INFO L225 Difference]: With dead ends: 125 [2022-03-17 15:17:09,994 INFO L226 Difference]: Without dead ends: 125 [2022-03-17 15:17:09,995 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:17:09,995 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:17:09,995 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:17:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-17 15:17:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 70. [2022-03-17 15:17:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-03-17 15:17:10,006 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 38 [2022-03-17 15:17:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:17:10,006 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-03-17 15:17:10,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-03-17 15:17:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-17 15:17:10,007 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:17:10,007 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:17:10,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-17 15:17:10,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:10,208 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:17:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:17:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1150947292, now seen corresponding path program 4 times [2022-03-17 15:17:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:17:10,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102654207] [2022-03-17 15:17:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:17:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:17:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:17:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-17 15:17:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:17:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102654207] [2022-03-17 15:17:10,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102654207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:17:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094193912] [2022-03-17 15:17:10,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 15:17:10,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:17:10,350 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:17:10,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 15:17:10,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 15:17:10,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:17:10,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-17 15:17:10,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:17:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:17:10,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:17:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-17 15:17:11,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094193912] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:17:11,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:17:11,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 35 [2022-03-17 15:17:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556950711] [2022-03-17 15:17:11,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:17:11,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-17 15:17:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:17:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-17 15:17:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-03-17 15:17:11,076 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:28,317 WARN L232 SmtUtils]: Spent 14.42s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:17:30,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:17:36,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:17:38,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:17:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:17:45,847 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2022-03-17 15:17:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-17 15:17:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-03-17 15:17:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:17:45,848 INFO L225 Difference]: With dead ends: 130 [2022-03-17 15:17:45,849 INFO L226 Difference]: Without dead ends: 125 [2022-03-17 15:17:45,850 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=602, Invalid=2704, Unknown=0, NotChecked=0, Total=3306 [2022-03-17 15:17:45,850 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-03-17 15:17:45,850 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 96 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 632 Invalid, 3 Unknown, 0 Unchecked, 8.9s Time] [2022-03-17 15:17:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-17 15:17:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 72. [2022-03-17 15:17:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-03-17 15:17:45,854 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 41 [2022-03-17 15:17:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:17:45,854 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-03-17 15:17:45,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-03-17 15:17:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-17 15:17:45,855 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:17:45,855 INFO L500 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:17:45,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-17 15:17:46,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:46,071 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:17:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:17:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1505099898, now seen corresponding path program 5 times [2022-03-17 15:17:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:17:46,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114986849] [2022-03-17 15:17:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:17:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:17:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:17:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 199 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-03-17 15:17:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:17:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114986849] [2022-03-17 15:17:46,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114986849] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:17:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334945389] [2022-03-17 15:17:46,209 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-17 15:17:46,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:17:46,210 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:17:46,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 15:17:46,261 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-17 15:17:46,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:17:46,262 WARN L261 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-17 15:17:46,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:17:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 286 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-17 15:17:46,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:17:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 226 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-03-17 15:17:46,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334945389] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:17:46,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:17:46,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 5] total 25 [2022-03-17 15:17:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261070488] [2022-03-17 15:17:46,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:17:46,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-17 15:17:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:17:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-17 15:17:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2022-03-17 15:17:46,821 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:17:47,240 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-03-17 15:17:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 15:17:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-03-17 15:17:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:17:47,241 INFO L225 Difference]: With dead ends: 106 [2022-03-17 15:17:47,241 INFO L226 Difference]: Without dead ends: 74 [2022-03-17 15:17:47,241 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2022-03-17 15:17:47,241 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:17:47,242 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 57 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 15:17:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-17 15:17:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-03-17 15:17:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-03-17 15:17:47,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 59 [2022-03-17 15:17:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:17:47,248 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-03-17 15:17:47,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-03-17 15:17:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-17 15:17:47,249 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:17:47,249 INFO L500 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:17:47,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-17 15:17:47,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:47,459 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:17:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:17:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -748666459, now seen corresponding path program 6 times [2022-03-17 15:17:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:17:47,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446619579] [2022-03-17 15:17:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:17:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:17:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:17:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:17:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:17:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446619579] [2022-03-17 15:17:47,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446619579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:17:47,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142043321] [2022-03-17 15:17:47,768 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-17 15:17:47,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:17:47,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:17:47,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-17 15:17:47,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-17 15:17:47,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:17:47,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 15:17:47,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:17:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-03-17 15:17:48,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:17:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-03-17 15:17:48,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142043321] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:17:48,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:17:48,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 29 [2022-03-17 15:17:48,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564729667] [2022-03-17 15:17:48,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:17:48,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-17 15:17:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:17:48,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-17 15:17:48,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-17 15:17:48,349 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:17:49,456 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-03-17 15:17:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-17 15:17:49,457 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-03-17 15:17:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:17:49,457 INFO L225 Difference]: With dead ends: 87 [2022-03-17 15:17:49,457 INFO L226 Difference]: Without dead ends: 82 [2022-03-17 15:17:49,458 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-03-17 15:17:49,459 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 162 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-17 15:17:49,459 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 112 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-17 15:17:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-03-17 15:17:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-03-17 15:17:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-03-17 15:17:49,462 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-03-17 15:17:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:17:49,462 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-03-17 15:17:49,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:17:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-03-17 15:17:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-03-17 15:17:49,463 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:17:49,463 INFO L500 BasicCegarLoop]: trace histogram [22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:17:49,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-17 15:17:49,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-17 15:17:49,675 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:17:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:17:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1474088538, now seen corresponding path program 7 times [2022-03-17 15:17:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:17:49,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965892397] [2022-03-17 15:17:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:17:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:17:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:17:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 15:17:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:17:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965892397] [2022-03-17 15:17:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965892397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:17:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695250997] [2022-03-17 15:17:50,006 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-17 15:17:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:17:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:17:50,007 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:17:50,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-17 15:17:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:17:50,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-17 15:17:50,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:17:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-17 15:17:50,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:17:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-17 15:17:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695250997] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:17:51,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:17:51,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2022-03-17 15:17:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014744179] [2022-03-17 15:17:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:17:51,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-17 15:17:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:17:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-17 15:17:51,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2022-03-17 15:17:51,130 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:18:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:18:55,281 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-03-17 15:18:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-17 15:18:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-03-17 15:18:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:18:55,282 INFO L225 Difference]: With dead ends: 144 [2022-03-17 15:18:55,282 INFO L226 Difference]: Without dead ends: 144 [2022-03-17 15:18:55,284 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=1883, Invalid=5089, Unknown=0, NotChecked=0, Total=6972 [2022-03-17 15:18:55,284 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 166 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-17 15:18:55,284 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 114 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-17 15:18:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-17 15:18:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-03-17 15:18:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:18:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-03-17 15:18:55,288 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 77 [2022-03-17 15:18:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:18:55,288 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-03-17 15:18:55,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:18:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-03-17 15:18:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-17 15:18:55,289 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:18:55,290 INFO L500 BasicCegarLoop]: trace histogram [44, 44, 40, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:18:55,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-17 15:18:55,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:18:55,499 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:18:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:18:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 439564262, now seen corresponding path program 8 times [2022-03-17 15:18:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:18:55,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355341480] [2022-03-17 15:18:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:18:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:18:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:18:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:18:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:18:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 447 proven. 2420 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 15:18:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:18:56,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355341480] [2022-03-17 15:18:56,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355341480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:18:56,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187014351] [2022-03-17 15:18:56,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:18:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:18:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:18:56,426 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:18:56,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-17 15:18:56,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:18:56,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:18:56,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 103 conjunts are in the unsatisfiable core [2022-03-17 15:18:56,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:18:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:18:58,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:19:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-17 15:19:02,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187014351] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:19:02,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:19:02,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 45] total 136 [2022-03-17 15:19:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718359520] [2022-03-17 15:19:02,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:19:02,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-03-17 15:19:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:19:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-03-17 15:19:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=15960, Unknown=0, NotChecked=0, Total=18360 [2022-03-17 15:19:02,459 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:19:07,761 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:09,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:11,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:13,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:16,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:18,154 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:20,166 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:22,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:24,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:26,209 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:28,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:30,396 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:32,406 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:34,423 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:36,444 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:38,455 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:40,467 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:42,476 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:44,487 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:46,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:48,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:50,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:52,525 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:54,537 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:56,547 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:19:58,575 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:24:54,454 WARN L232 SmtUtils]: Spent 1.84m on a formula simplification that was a NOOP. DAG size: 145 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:24:56,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:24:58,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:00,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:02,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:04,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:06,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:08,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:10,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:12,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:14,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:16,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:18,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:20,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:25:22,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-17 15:25:24,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:25:26,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:25:28,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:25:30,638 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:25:32,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:25:34,661 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:25:36,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:03,264 WARN L232 SmtUtils]: Spent 1.49m on a formula simplification that was a NOOP. DAG size: 125 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:30:05,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:07,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:09,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:11,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:13,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:15,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:17,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:19,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:21,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:24,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:26,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:28,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:30,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:32,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-17 15:30:34,821 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-17 15:30:36,829 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:38,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:40,851 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:42,873 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:44,912 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:46,935 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:48,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:50,955 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-03-17 15:30:52,977 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false