./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Benghazi.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Benghazi.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9edf84ee73e15e033440f38035e679f46457b07702832d589a58530a086e57e5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 13:16:47,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:16:47,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:16:47,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:16:47,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:16:47,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:16:47,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:16:47,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:16:47,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:16:47,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:16:47,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:16:47,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:16:47,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:16:47,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:16:47,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:16:47,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:16:47,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:16:47,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:16:47,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:16:47,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:16:47,642 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:16:47,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:16:47,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:16:47,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:16:47,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:16:47,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:16:47,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:16:47,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:16:47,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:16:47,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:16:47,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:16:47,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:16:47,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:16:47,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:16:47,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:16:47,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:16:47,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:16:47,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:16:47,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:16:47,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:16:47,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:16:47,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:16:47,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-07-23 13:16:47,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:16:47,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:16:47,702 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:16:47,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:16:47,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:16:47,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:16:47,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:16:47,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:16:47,705 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:16:47,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:16:47,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:16:47,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:16:47,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:16:47,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 13:16:47,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:16:47,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 13:16:47,707 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-23 13:16:47,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 13:16:47,707 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:16:47,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 13:16:47,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:16:47,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:16:47,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:16:47,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:16:47,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:16:47,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:16:47,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 13:16:47,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 13:16:47,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 13:16:47,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 13:16:47,710 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9edf84ee73e15e033440f38035e679f46457b07702832d589a58530a086e57e5 [2022-07-23 13:16:47,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:16:48,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:16:48,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:16:48,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:16:48,004 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:16:48,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Benghazi.c [2022-07-23 13:16:48,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c4514e9/3aa55e275df74d9e8731bbb85fc9297e/FLAGdec5a29d7 [2022-07-23 13:16:48,500 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:16:48,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Benghazi.c [2022-07-23 13:16:48,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c4514e9/3aa55e275df74d9e8731bbb85fc9297e/FLAGdec5a29d7 [2022-07-23 13:16:48,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c4514e9/3aa55e275df74d9e8731bbb85fc9297e [2022-07-23 13:16:48,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:16:48,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:16:48,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:16:48,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:16:48,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:16:48,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:16:48" (1/1) ... [2022-07-23 13:16:48,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e4f5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:48, skipping insertion in model container [2022-07-23 13:16:48,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:16:48" (1/1) ... [2022-07-23 13:16:48,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:16:48,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:16:49,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:16:49,070 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 13:16:49,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:16:49,091 INFO L208 MainTranslator]: Completed translation [2022-07-23 13:16:49,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49 WrapperNode [2022-07-23 13:16:49,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:16:49,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 13:16:49,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 13:16:49,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 13:16:49,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,119 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-07-23 13:16:49,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 13:16:49,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 13:16:49,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 13:16:49,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 13:16:49,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 13:16:49,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 13:16:49,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 13:16:49,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 13:16:49,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (1/1) ... [2022-07-23 13:16:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:16:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:49,165 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-07-23 13:16:49,181 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-07-23 13:16:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 13:16:49,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 13:16:49,267 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 13:16:49,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 13:16:49,390 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 13:16:49,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 13:16:49,397 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 13:16:49,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:16:49 BoogieIcfgContainer [2022-07-23 13:16:49,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 13:16:49,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 13:16:49,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 13:16:49,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 13:16:49,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:16:48" (1/3) ... [2022-07-23 13:16:49,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c4efda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:16:49, skipping insertion in model container [2022-07-23 13:16:49,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:16:49" (2/3) ... [2022-07-23 13:16:49,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c4efda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:16:49, skipping insertion in model container [2022-07-23 13:16:49,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:16:49" (3/3) ... [2022-07-23 13:16:49,407 INFO L111 eAbstractionObserver]: Analyzing ICFG Benghazi.c [2022-07-23 13:16:49,423 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 13:16:49,423 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-07-23 13:16:49,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 13:16:49,528 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3db05e28, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@913081d [2022-07-23 13:16:49,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-23 13:16:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 13:16:49,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:49,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 13:16:49,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-07-23 13:16:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:49,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006247729] [2022-07-23 13:16:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:49,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006247729] [2022-07-23 13:16:49,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006247729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:49,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:49,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:16:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128016132] [2022-07-23 13:16:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:49,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:16:49,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:16:49,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:16:49,778 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:49,831 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-07-23 13:16:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:16:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-23 13:16:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:49,841 INFO L225 Difference]: With dead ends: 31 [2022-07-23 13:16:49,841 INFO L226 Difference]: Without dead ends: 18 [2022-07-23 13:16:49,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-23 13:16:49,850 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:49,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-23 13:16:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-23 13:16:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-07-23 13:16:49,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2022-07-23 13:16:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:49,883 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-07-23 13:16:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-07-23 13:16:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 13:16:49,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:49,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 13:16:49,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 13:16:49,885 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:49,888 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-07-23 13:16:49,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:49,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237083410] [2022-07-23 13:16:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:49,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237083410] [2022-07-23 13:16:49,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237083410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:49,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:49,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:16:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999646464] [2022-07-23 13:16:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:49,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:16:49,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:49,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:16:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:16:49,949 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:50,005 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-07-23 13:16:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:16:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 13:16:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:50,007 INFO L225 Difference]: With dead ends: 23 [2022-07-23 13:16:50,008 INFO L226 Difference]: Without dead ends: 22 [2022-07-23 13:16:50,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:16:50,015 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:50,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-23 13:16:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-07-23 13:16:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-07-23 13:16:50,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2022-07-23 13:16:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:50,025 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-07-23 13:16:50,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-07-23 13:16:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 13:16:50,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:50,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 13:16:50,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 13:16:50,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2022-07-23 13:16:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:50,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721359860] [2022-07-23 13:16:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721359860] [2022-07-23 13:16:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721359860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:50,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:16:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429410793] [2022-07-23 13:16:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:16:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:16:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:16:50,074 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:50,089 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-23 13:16:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:16:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-23 13:16:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:50,092 INFO L225 Difference]: With dead ends: 25 [2022-07-23 13:16:50,092 INFO L226 Difference]: Without dead ends: 24 [2022-07-23 13:16:50,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-23 13:16:50,095 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:50,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-23 13:16:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-07-23 13:16:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-07-23 13:16:50,105 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 6 [2022-07-23 13:16:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:50,105 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-07-23 13:16:50,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-07-23 13:16:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 13:16:50,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:50,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:50,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 13:16:50,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2022-07-23 13:16:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:50,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506932963] [2022-07-23 13:16:50,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:50,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506932963] [2022-07-23 13:16:50,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506932963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:50,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:50,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:16:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090540353] [2022-07-23 13:16:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:16:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:50,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:16:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:16:50,154 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:50,170 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-07-23 13:16:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:16:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 13:16:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:50,173 INFO L225 Difference]: With dead ends: 25 [2022-07-23 13:16:50,173 INFO L226 Difference]: Without dead ends: 24 [2022-07-23 13:16:50,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-23 13:16:50,184 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:50,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-23 13:16:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-23 13:16:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-07-23 13:16:50,193 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2022-07-23 13:16:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:50,194 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-07-23 13:16:50,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-07-23 13:16:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 13:16:50,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:50,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:50,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 13:16:50,195 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 294943144, now seen corresponding path program 1 times [2022-07-23 13:16:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:50,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318914942] [2022-07-23 13:16:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318914942] [2022-07-23 13:16:50,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318914942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:50,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:50,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:16:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061959084] [2022-07-23 13:16:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:50,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:16:50,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:16:50,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:16:50,229 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:50,274 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-23 13:16:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:16:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 13:16:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:50,276 INFO L225 Difference]: With dead ends: 28 [2022-07-23 13:16:50,276 INFO L226 Difference]: Without dead ends: 27 [2022-07-23 13:16:50,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:16:50,277 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 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-07-23 13:16:50,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-23 13:16:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-07-23 13:16:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-07-23 13:16:50,281 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2022-07-23 13:16:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:50,282 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-07-23 13:16:50,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-07-23 13:16:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:16:50,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:50,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 13:16:50,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash 553302925, now seen corresponding path program 1 times [2022-07-23 13:16:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043779725] [2022-07-23 13:16:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:50,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043779725] [2022-07-23 13:16:50,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043779725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:50,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:50,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:16:50,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040167533] [2022-07-23 13:16:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:50,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:16:50,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:50,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:16:50,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:16:50,313 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:50,357 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-07-23 13:16:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:16:50,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 13:16:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:50,359 INFO L225 Difference]: With dead ends: 28 [2022-07-23 13:16:50,361 INFO L226 Difference]: Without dead ends: 27 [2022-07-23 13:16:50,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:16:50,363 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:50,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-23 13:16:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-23 13:16:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-07-23 13:16:50,370 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 9 [2022-07-23 13:16:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:50,370 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-07-23 13:16:50,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-07-23 13:16:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 13:16:50,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:50,371 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:50,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 13:16:50,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -851832465, now seen corresponding path program 1 times [2022-07-23 13:16:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:50,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176728652] [2022-07-23 13:16:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176728652] [2022-07-23 13:16:50,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176728652] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757969134] [2022-07-23 13:16:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:50,425 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-07-23 13:16:50,426 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-07-23 13:16:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 13:16:50,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757969134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:50,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:50,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-23 13:16:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117867120] [2022-07-23 13:16:50,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:50,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 13:16:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:50,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 13:16:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-23 13:16:50,655 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:50,736 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-23 13:16:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 13:16:50,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 13:16:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:50,737 INFO L225 Difference]: With dead ends: 31 [2022-07-23 13:16:50,737 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 13:16:50,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-23 13:16:50,739 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:50,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 31 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 13:16:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-23 13:16:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-07-23 13:16:50,747 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2022-07-23 13:16:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:50,747 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-07-23 13:16:50,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-07-23 13:16:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 13:16:50,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:50,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:50,767 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-07-23 13:16:50,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:50,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash -637002594, now seen corresponding path program 1 times [2022-07-23 13:16:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:50,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956303008] [2022-07-23 13:16:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:50,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:50,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956303008] [2022-07-23 13:16:50,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956303008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:50,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161494481] [2022-07-23 13:16:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:51,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:51,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:51,001 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-07-23 13:16:51,002 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-07-23 13:16:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:51,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:16:51,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:51,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:51,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161494481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:51,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:51,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-23 13:16:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836471055] [2022-07-23 13:16:51,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:51,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 13:16:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 13:16:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-23 13:16:51,112 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:51,209 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-23 13:16:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 13:16:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 13:16:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:51,211 INFO L225 Difference]: With dead ends: 29 [2022-07-23 13:16:51,211 INFO L226 Difference]: Without dead ends: 28 [2022-07-23 13:16:51,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-07-23 13:16:51,212 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:51,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 37 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-23 13:16:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-07-23 13:16:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-07-23 13:16:51,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2022-07-23 13:16:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:51,221 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-07-23 13:16:51,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-07-23 13:16:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 13:16:51,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:51,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:51,245 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-07-23 13:16:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-23 13:16:51,438 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1727756113, now seen corresponding path program 1 times [2022-07-23 13:16:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904562288] [2022-07-23 13:16:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904562288] [2022-07-23 13:16:51,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904562288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269459209] [2022-07-23 13:16:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:51,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:51,496 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-07-23 13:16:51,498 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-07-23 13:16:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:51,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:16:51,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:51,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:51,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269459209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:51,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:51,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 13:16:51,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674198606] [2022-07-23 13:16:51,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:51,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:16:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:16:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 13:16:51,588 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:51,705 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-07-23 13:16:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:16:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 13:16:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:51,707 INFO L225 Difference]: With dead ends: 45 [2022-07-23 13:16:51,708 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 13:16:51,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-23 13:16:51,710 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:51,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 26 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:16:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 13:16:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-23 13:16:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-23 13:16:51,720 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 13 [2022-07-23 13:16:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:51,720 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-23 13:16:51,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-23 13:16:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 13:16:51,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:51,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 13:16:51,741 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-07-23 13:16:51,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:51,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2020832000, now seen corresponding path program 1 times [2022-07-23 13:16:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:51,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532406726] [2022-07-23 13:16:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:51,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532406726] [2022-07-23 13:16:51,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532406726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:16:51,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:16:51,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:16:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269657628] [2022-07-23 13:16:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:16:51,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:16:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:16:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:16:51,962 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:51,969 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-23 13:16:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:16:51,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 13:16:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:51,970 INFO L225 Difference]: With dead ends: 39 [2022-07-23 13:16:51,970 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 13:16:51,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-23 13:16:51,971 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:51,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 13:16:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-23 13:16:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-23 13:16:51,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2022-07-23 13:16:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:51,976 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-23 13:16:51,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-23 13:16:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 13:16:51,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:51,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-23 13:16:51,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 13:16:51,977 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 694335842, now seen corresponding path program 1 times [2022-07-23 13:16:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:51,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791884242] [2022-07-23 13:16:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:52,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:52,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791884242] [2022-07-23 13:16:52,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791884242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735533103] [2022-07-23 13:16:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:52,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:52,009 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-07-23 13:16:52,010 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-07-23 13:16:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:52,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:16:52,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:52,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:52,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735533103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:52,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:52,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 13:16:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383978767] [2022-07-23 13:16:52,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:52,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:16:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:16:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 13:16:52,106 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:52,229 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-07-23 13:16:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 13:16:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 13:16:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:52,230 INFO L225 Difference]: With dead ends: 48 [2022-07-23 13:16:52,230 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 13:16:52,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-07-23 13:16:52,232 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:52,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:16:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 13:16:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-07-23 13:16:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-07-23 13:16:52,237 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2022-07-23 13:16:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:52,238 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-07-23 13:16:52,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-07-23 13:16:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 13:16:52,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:52,239 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-23 13:16:52,267 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-07-23 13:16:52,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:52,456 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1536814596, now seen corresponding path program 2 times [2022-07-23 13:16:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:52,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46434234] [2022-07-23 13:16:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:52,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:52,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46434234] [2022-07-23 13:16:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46434234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645802122] [2022-07-23 13:16:52,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:16:52,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:52,528 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-07-23 13:16:52,530 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-07-23 13:16:52,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 13:16:52,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:16:52,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 13:16:52,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:52,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645802122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:52,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:52,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-07-23 13:16:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168726192] [2022-07-23 13:16:52,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:52,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 13:16:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:52,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 13:16:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-23 13:16:52,831 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:52,932 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-07-23 13:16:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:16:52,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 13:16:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:52,933 INFO L225 Difference]: With dead ends: 37 [2022-07-23 13:16:52,933 INFO L226 Difference]: Without dead ends: 36 [2022-07-23 13:16:52,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-07-23 13:16:52,934 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:52,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:16:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-23 13:16:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-23 13:16:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-07-23 13:16:52,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 18 [2022-07-23 13:16:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:52,939 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-07-23 13:16:52,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-07-23 13:16:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 13:16:52,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:52,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2022-07-23 13:16:52,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 13:16:53,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-23 13:16:53,163 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 906255251, now seen corresponding path program 1 times [2022-07-23 13:16:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:53,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827138062] [2022-07-23 13:16:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:53,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827138062] [2022-07-23 13:16:53,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827138062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:53,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109844041] [2022-07-23 13:16:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:53,224 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-07-23 13:16:53,225 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-07-23 13:16:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:53,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 13:16:53,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:53,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:53,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109844041] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:53,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:53,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-23 13:16:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422178966] [2022-07-23 13:16:53,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:53,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 13:16:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:53,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 13:16:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-23 13:16:53,363 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:53,574 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-07-23 13:16:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 13:16:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 13:16:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:53,582 INFO L225 Difference]: With dead ends: 69 [2022-07-23 13:16:53,582 INFO L226 Difference]: Without dead ends: 67 [2022-07-23 13:16:53,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2022-07-23 13:16:53,584 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:53,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 40 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:16:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-23 13:16:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-07-23 13:16:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.046875) internal successors, (67), 65 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-07-23 13:16:53,601 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 29 [2022-07-23 13:16:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:53,601 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-07-23 13:16:53,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-07-23 13:16:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 13:16:53,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:53,603 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 1, 1, 1] [2022-07-23 13:16:53,652 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-07-23 13:16:53,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:53,806 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2015761009, now seen corresponding path program 2 times [2022-07-23 13:16:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:53,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875309851] [2022-07-23 13:16:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:53,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:53,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875309851] [2022-07-23 13:16:53,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875309851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:53,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132513117] [2022-07-23 13:16:53,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:16:53,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:54,000 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-07-23 13:16:54,002 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-07-23 13:16:54,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 13:16:54,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:16:54,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 13:16:54,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:54,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:54,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132513117] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:54,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:54,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-23 13:16:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907732596] [2022-07-23 13:16:54,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:54,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 13:16:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:54,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 13:16:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2022-07-23 13:16:54,291 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 26 states, 25 states have (on average 4.36) internal successors, (109), 26 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:54,784 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-23 13:16:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 13:16:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.36) internal successors, (109), 26 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-23 13:16:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:54,785 INFO L225 Difference]: With dead ends: 122 [2022-07-23 13:16:54,785 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 13:16:54,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=750, Invalid=1700, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 13:16:54,787 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 166 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:54,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 48 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:16:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 13:16:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 13:16:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2022-07-23 13:16:54,810 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 55 [2022-07-23 13:16:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:54,811 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2022-07-23 13:16:54,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.36) internal successors, (109), 26 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-07-23 13:16:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 13:16:54,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:54,818 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 1, 1, 1] [2022-07-23 13:16:54,846 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-07-23 13:16:55,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:55,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash 875637203, now seen corresponding path program 2 times [2022-07-23 13:16:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:55,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034626202] [2022-07-23 13:16:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:55,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034626202] [2022-07-23 13:16:55,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034626202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:55,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737336220] [2022-07-23 13:16:55,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:16:55,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:55,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:55,358 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-07-23 13:16:55,359 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-07-23 13:16:55,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 13:16:55,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:16:55,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 13:16:55,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:55,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:16:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:56,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737336220] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:16:56,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:16:56,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-23 13:16:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102981589] [2022-07-23 13:16:56,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:16:56,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 13:16:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:16:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 13:16:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 13:16:56,100 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand has 50 states, 49 states have (on average 4.591836734693878) internal successors, (225), 50 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:16:57,498 INFO L93 Difference]: Finished difference Result 237 states and 267 transitions. [2022-07-23 13:16:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-23 13:16:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 4.591836734693878) internal successors, (225), 50 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-07-23 13:16:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:16:57,500 INFO L225 Difference]: With dead ends: 237 [2022-07-23 13:16:57,500 INFO L226 Difference]: Without dead ends: 235 [2022-07-23 13:16:57,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2842, Invalid=6664, Unknown=0, NotChecked=0, Total=9506 [2022-07-23 13:16:57,504 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 359 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 13:16:57,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 83 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 13:16:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-23 13:16:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2022-07-23 13:16:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 232 states have (on average 1.0129310344827587) internal successors, (235), 233 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2022-07-23 13:16:57,515 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 113 [2022-07-23 13:16:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:16:57,516 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2022-07-23 13:16:57,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.591836734693878) internal successors, (225), 50 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:16:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2022-07-23 13:16:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-23 13:16:57,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:16:57,518 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 1, 1, 1] [2022-07-23 13:16:57,550 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-07-23 13:16:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-23 13:16:57,743 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:16:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:16:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 863858417, now seen corresponding path program 3 times [2022-07-23 13:16:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:16:57,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014010779] [2022-07-23 13:16:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:16:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:16:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:16:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3379 backedges. 0 proven. 3379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:16:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:16:58,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014010779] [2022-07-23 13:16:58,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014010779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:16:58,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679631247] [2022-07-23 13:16:58,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 13:16:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:16:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:16:58,649 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-07-23 13:16:58,650 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-07-23 13:16:58,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-23 13:16:58,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:16:58,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 13:16:58,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:16:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3379 backedges. 1131 proven. 123 refuted. 0 times theorem prover too weak. 2125 trivial. 0 not checked. [2022-07-23 13:16:59,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:17:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3379 backedges. 1131 proven. 123 refuted. 0 times theorem prover too weak. 2125 trivial. 0 not checked. [2022-07-23 13:17:03,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679631247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:17:03,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:17:03,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 19, 20] total 85 [2022-07-23 13:17:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239277872] [2022-07-23 13:17:03,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:17:03,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-23 13:17:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:17:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-23 13:17:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=6585, Unknown=1, NotChecked=0, Total=7310 [2022-07-23 13:17:03,050 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand has 86 states, 85 states have (on average 3.764705882352941) internal successors, (320), 86 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:17:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:17:25,679 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2022-07-23 13:17:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2022-07-23 13:17:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.764705882352941) internal successors, (320), 86 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2022-07-23 13:17:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:17:25,681 INFO L225 Difference]: With dead ends: 235 [2022-07-23 13:17:25,681 INFO L226 Difference]: Without dead ends: 234 [2022-07-23 13:17:25,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17101 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=13177, Invalid=49572, Unknown=1, NotChecked=0, Total=62750 [2022-07-23 13:17:25,690 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1748 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:17:25,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 28 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 758 Invalid, 0 Unknown, 41 Unchecked, 1.2s Time] [2022-07-23 13:17:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-23 13:17:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2022-07-23 13:17:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.0043103448275863) internal successors, (233), 232 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:17:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2022-07-23 13:17:25,707 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 223 [2022-07-23 13:17:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:17:25,708 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2022-07-23 13:17:25,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.764705882352941) internal successors, (320), 86 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:17:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2022-07-23 13:17:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-23 13:17:25,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:17:25,710 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 1, 1, 1] [2022-07-23 13:17:25,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-23 13:17:25,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 13:17:25,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-23 13:17:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:17:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1072370600, now seen corresponding path program 3 times [2022-07-23 13:17:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:17:25,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974198200] [2022-07-23 13:17:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:17:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:17:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:17:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3664 backedges. 0 proven. 3664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 13:17:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:17:26,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974198200] [2022-07-23 13:17:26,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974198200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:17:26,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357732485] [2022-07-23 13:17:26,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 13:17:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:17:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:17:26,813 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-07-23 13:17:26,814 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-07-23 13:17:26,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-23 13:17:26,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:17:26,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-23 13:17:26,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:17:29,177 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse1 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse0 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse0 (+ .cse1 2147483651)) (< (+ .cse1 2147483647) .cse0) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| 1))))) is different from true [2022-07-23 13:17:30,370 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse1 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse0 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse0 (+ .cse1 2147483651)) (< (+ .cse1 2147483647) .cse0) (<= |c_ULTIMATE.start_main_~d1~0#1| (+ 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290)))) is different from true [2022-07-23 13:17:31,600 WARN L855 $PredicateComparison]: unable to prove that (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse1 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse0 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse0 (+ .cse1 2147483651)) (<= |c_ULTIMATE.start_main_~d1old~0#1| (+ 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (< (+ .cse1 2147483647) .cse0) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290)))) is different from true [2022-07-23 13:17:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3664 backedges. 1573 proven. 196 refuted. 0 times theorem prover too weak. 1794 trivial. 101 not checked. [2022-07-23 13:17:31,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:17:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3664 backedges. 1573 proven. 297 refuted. 0 times theorem prover too weak. 1794 trivial. 0 not checked. [2022-07-23 13:17:49,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357732485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:17:49,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 13:17:49,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 103 [2022-07-23 13:17:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418192536] [2022-07-23 13:17:49,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 13:17:49,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-23 13:17:49,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:17:49,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-23 13:17:49,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=836, Invalid=9270, Unknown=6, NotChecked=600, Total=10712 [2022-07-23 13:17:49,324 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand has 104 states, 103 states have (on average 3.6699029126213594) internal successors, (378), 104 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 13:17:51,592 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* 2 |c_ULTIMATE.start_main_~d1~0#1|))) (let ((.cse0 (<= |c_ULTIMATE.start_main_~d1old~0#1| 2147483642)) (.cse1 (* (- 1) |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (<= |c_ULTIMATE.start_main_~x~0#1| (+ 4294967289 .cse3)))) (and (or .cse0 (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~d1~0#1| 2147483644))) (or .cse0 (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483645 |c_ULTIMATE.start_main_~d2~0#1|))) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~d1~0#1|) 4294967290 .cse1) (- 2)) |c_ULTIMATE.start_main_~x~0#1|) 2147483641) (<= 0 |c_ULTIMATE.start_main_~x~0#1|) (or .cse2 (not (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1|))) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse3 2147483648))) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse4 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse8 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse5 (+ 2 |c_ULTIMATE.start_main_~d1~0#1|)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse10 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1| .cse4)) (.cse6 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse11 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ .cse4 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse5) (<= (+ .cse6 |c_ULTIMATE.start_main_~d1~0#1| 2147483646) .cse7) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse8 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ |c_ULTIMATE.start_main_~d1~0#1| .cse4 2147483646) .cse9) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse5) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse10 |c_ULTIMATE.start_main_~d1~0#1|) .cse9) (<= (+ 6442450936 .cse10 |c_ULTIMATE.start_main_~d1~0#1| .cse11) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse4) .cse8) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse11) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483644 .cse11) |c_ULTIMATE.start_main_~d2~0#1|) (<= (+ 4294967291 .cse10 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse7) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse6 2147483641)) (<= (+ 2 .cse8) .cse4) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|) (<= (+ 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse11 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|))))) (<= |c_ULTIMATE.start_main_~d2~0#1| 74) (<= (+ 5 (div (+ 2147483642 |c_ULTIMATE.start_main_~d2~0#1|) (- 2))) (+ |c_ULTIMATE.start_main_~d1~0#1| |c_ULTIMATE.start_main_~d2~0#1|)) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse15 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse17 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse12 (+ 2 |c_ULTIMATE.start_main_~d1~0#1|)) (.cse16 (+ |c_ULTIMATE.start_main_~x~0#1| .cse17)) (.cse18 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1| .cse15)) (.cse13 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse19 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse12) (<= (+ .cse13 |c_ULTIMATE.start_main_~d1~0#1| 2147483646) .cse14) (<= (+ |c_ULTIMATE.start_main_~d1~0#1| .cse15 2147483646) .cse16) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ 2 .cse17 |c_ULTIMATE.start_main_~d1old~0#1|)) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse12) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse18 |c_ULTIMATE.start_main_~d1~0#1|) .cse16) (<= (+ 6442450936 .cse18 |c_ULTIMATE.start_main_~d1~0#1| .cse19) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse15) .cse17) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ 2 |c_ULTIMATE.start_main_~d1old~0#1| .cse15)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse19) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 4294967291 .cse18 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse14) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse13 2147483641)) (<= (+ 2147483643 .cse19) |c_ULTIMATE.start_main_~d1old~0#1|) (<= (+ 2 .cse17) .cse15) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|) (<= (+ 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse19 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|))))) (let ((.cse20 (div (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse1 2147483648) (- 2))) (.cse22 (div (+ .cse1 4294967289) (- 2))) (.cse21 (+ 1 |c_ULTIMATE.start_main_~d2~0#1|))) (or (<= (+ .cse20 2147483647) |c_ULTIMATE.start_main_~x~0#1|) (<= .cse20 .cse21) (<= (+ .cse22 2147483647) |c_ULTIMATE.start_main_~x~0#1|) (<= .cse22 .cse21))) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse24 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse23 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse23 (+ .cse24 2147483651)) (< (+ .cse24 2147483647) .cse23) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| 1))))) (<= (+ |c_ULTIMATE.start_main_~x~0#1| (div (+ (* (- 1) |c_ULTIMATE.start_main_~d2~0#1|) .cse1 4294967289) (- 2))) 2147483641) (<= |c_ULTIMATE.start_main_~d1~0#1| 73) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ (div (+ (div (+ 4294967290 .cse1) 2) .cse1 2147483641) 2) 1)) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse25 (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|) |c_ULTIMATE.start_main_~x~0#1|)) (.cse30 (+ |c_ULTIMATE.start_main_~x~0#1| (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4))) (.cse31 (+ 3 |c_ULTIMATE.start_main_~d2~0#1|)) (.cse28 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse27 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse26 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse32 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse29 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 4))) (or (<= (+ 2147483640 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 3)) .cse25) (<= (+ .cse26 4294967285 .cse27) .cse25) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse27) .cse28) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 6442450930 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse29) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ .cse26 4294967285 (* 3 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) .cse30) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse31) (<= (+ .cse26 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| 8589934575 .cse29) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ (* 4 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) 2147483640) .cse30) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse32 2147483641)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse31) (<= (+ 2 .cse28) .cse27) (<= (+ .cse26 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| 8589934575 .cse29) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ .cse32 6442450930 .cse29) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)))) (or (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 .cse3 |c_ULTIMATE.start_main_~d2~0#1|)) .cse2)))) is different from false [2022-07-23 13:20:05,398 WARN L233 SmtUtils]: Spent 41.77s on a formula simplification. DAG size of input: 168 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 13:20:07,495 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_ULTIMATE.start_main_~x~0#1|)) (.cse15 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~d1old~0#1|))) (and (<= (+ |c_ULTIMATE.start_main_~x~0#1| (* 2 |c_ULTIMATE.start_main_~d1old~0#1|)) (+ (div (+ 4294967290 .cse0) 2) 2147483641)) (or (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~d1old~0#1| 4294967289)) (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 |c_ULTIMATE.start_main_~d1old~0#1| |c_ULTIMATE.start_main_~d2~0#1|))) (<= |c_ULTIMATE.start_main_~d1old~0#1| 73) (<= |c_ULTIMATE.start_main_~d2~0#1| 74) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse3 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1| .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse7 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse8 (+ 3 |c_ULTIMATE.start_main_~d2~0#1|)) (.cse6 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse1 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= (+ 6442450933 .cse1 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse2) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483643 .cse3) .cse4) (<= (+ 2147483643 (* 3 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) .cse5) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ 2 .cse6 |c_ULTIMATE.start_main_~d1old~0#1|)) (<= (+ 4294967288 .cse1 .cse7) .cse5) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse3) .cse6) (<= (+ 4294967288 .cse7 .cse2) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967288 .cse1) .cse4) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967288 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse2) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse8) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ 2 |c_ULTIMATE.start_main_~d1old~0#1| .cse3)) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse7 2147483641)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse8) (<= (+ 2147483643 .cse2) |c_ULTIMATE.start_main_~d1old~0#1|) (<= (+ 2 .cse6) .cse3) (<= (+ 6442450933 .cse1 .cse2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|))))) (let ((.cse9 (div (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse0 2147483648) (- 2))) (.cse11 (div (+ .cse0 4294967289) (- 2))) (.cse10 (+ 1 |c_ULTIMATE.start_main_~d2~0#1|))) (or (<= (+ .cse9 2147483647) |c_ULTIMATE.start_main_~x~0#1|) (<= .cse9 .cse10) (<= (+ .cse11 2147483647) |c_ULTIMATE.start_main_~x~0#1|) (<= .cse11 .cse10))) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse13 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse12 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse12 (+ .cse13 2147483651)) (< (+ .cse13 2147483647) .cse12) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| 1))))) (let ((.cse14 (+ 2147483642 |c_ULTIMATE.start_main_~d2~0#1|))) (<= (+ |c_ULTIMATE.start_main_~x~0#1| (div .cse14 (- 2))) .cse14)) (<= .cse15 2147483647) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse21 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse18 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (let ((.cse20 (+ |c_ULTIMATE.start_main_~x~0#1| .cse18)) (.cse22 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2)) (.cse19 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse17 (+ 2 |c_ULTIMATE.start_main_~d1old~0#1|)) (.cse16 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse23 (+ |c_ULTIMATE.start_main_~x~0#1| .cse21))) (or (< |c_ULTIMATE.start_main_~x~0#1| (+ 4294967291 .cse16 |c_ULTIMATE.start_main_~d2~0#1|)) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse17) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ .cse18 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ .cse19 2147483646) .cse20) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse21 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ 6442450936 .cse16 .cse22) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse18) .cse21) (< |c_ULTIMATE.start_main_~x~0#1| (+ 6442450933 .cse16 .cse22)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= (+ .cse18 2147483646) .cse23) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse22) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483644 .cse22) |c_ULTIMATE.start_main_~d2~0#1|) (<= (+ 4294967291 .cse16 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse20) (<= (+ 4294967291 .cse22 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse19 2147483641)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse17) (<= (+ 2 .cse21) .cse18) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse16) .cse23) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|))))) (<= 0 .cse15))) is different from false [2022-07-23 13:20:09,661 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~d1old~0#1|))) (and (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse1 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse0 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse0 (+ .cse1 2147483651)) (< (+ .cse1 2147483647) .cse0) (<= |c_ULTIMATE.start_main_~d1~0#1| (+ 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290)))) (<= (+ |c_ULTIMATE.start_main_~x~0#1| (* 2 |c_ULTIMATE.start_main_~d1old~0#1|)) (+ (div (+ 4294967290 (* (- 1) |c_ULTIMATE.start_main_~x~0#1|)) 2) 2147483641)) (forall ((|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int)) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~d1old~0#1|)) (.cse4 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse3 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (or (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse2) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |c_ULTIMATE.start_main_~d1~0#1| .cse3)) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ |c_ULTIMATE.start_main_~d1~0#1| .cse4)) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse3) .cse4) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (div (+ (* (- 1) |c_ULTIMATE.start_main_~d1~0#1|) |c_ULTIMATE.start_main_~x~0#1| (- 4294967290)) 2)) (<= (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) 2147483641)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ (div (+ |c_ULTIMATE.start_main_~d1~0#1| (- 2147483643)) 2) |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse2) (<= (+ 2 .cse4) .cse3) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2147483647 |c_ULTIMATE.start_main_~d1~0#1|) |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse5 (* 2 |c_ULTIMATE.start_main_~d1~0#1|))) (or (<= |c_ULTIMATE.start_main_~x~0#1| (+ 4294967289 .cse5)) (not (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1|))) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse5 2147483648)))) (<= |c_ULTIMATE.start_main_~d1old~0#1| 73) (let ((.cse6 (+ |c_ULTIMATE.start_main_~d1~0#1| 2147483641))) (<= (+ (div .cse6 (- 2)) |c_ULTIMATE.start_main_~x~0#1|) .cse6)) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse10 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse12 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse7 (+ 2 |c_ULTIMATE.start_main_~d1~0#1|)) (.cse11 (+ |c_ULTIMATE.start_main_~x~0#1| .cse12)) (.cse13 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse8 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse14 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse7) (<= (+ .cse8 |c_ULTIMATE.start_main_~d1~0#1| 2147483646) .cse9) (<= (+ |c_ULTIMATE.start_main_~d1~0#1| .cse10 2147483646) .cse11) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ 2 .cse12 |c_ULTIMATE.start_main_~d1old~0#1|)) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse7) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse13 |c_ULTIMATE.start_main_~d1~0#1|) .cse11) (<= (+ 6442450936 .cse13 |c_ULTIMATE.start_main_~d1~0#1| .cse14) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse10) .cse12) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ 2 |c_ULTIMATE.start_main_~d1old~0#1| .cse10)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse14) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 4294967291 .cse13 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse9) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse8 2147483641)) (<= (+ 2147483643 .cse14) |c_ULTIMATE.start_main_~d1old~0#1|) (<= (+ 2 .cse12) .cse10) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|) (<= (+ 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse14 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|))))) (<= .cse15 2147483647) (<= |c_ULTIMATE.start_main_~d1~0#1| 75) (<= 0 .cse15))) is different from false [2022-07-23 13:20:11,925 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~d2~0#1|))) (and (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~d1~0#1|))) (or (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 .cse0 |c_ULTIMATE.start_main_~d2~0#1|)) (<= |c_ULTIMATE.start_main_~x~0#1| (+ 4294967289 .cse0)) (not (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1|))))) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse2 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse1 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse1 (+ .cse2 2147483651)) (< (+ .cse2 2147483647) .cse1) (<= |c_ULTIMATE.start_main_~d1~0#1| (+ 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290)))) (<= 1 .cse3) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse4 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse8 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse5 (+ 2 |c_ULTIMATE.start_main_~d1~0#1|)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1| .cse8)) (.cse10 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1| .cse4)) (.cse6 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse11 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ .cse4 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse5) (<= (+ .cse6 |c_ULTIMATE.start_main_~d1~0#1| 2147483646) .cse7) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse8 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ |c_ULTIMATE.start_main_~d1~0#1| .cse4 2147483646) .cse9) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse5) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse10 |c_ULTIMATE.start_main_~d1~0#1|) .cse9) (<= (+ 6442450936 .cse10 |c_ULTIMATE.start_main_~d1~0#1| .cse11) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse4) .cse8) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse11) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483644 .cse11) |c_ULTIMATE.start_main_~d2~0#1|) (<= (+ 4294967291 .cse10 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse7) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse6 2147483641)) (<= (+ 2 .cse8) .cse4) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|) (<= (+ 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse11 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|))))) (<= |c_ULTIMATE.start_main_~d2~0#1| 74) (let ((.cse12 (+ |c_ULTIMATE.start_main_~d1~0#1| 2147483641))) (<= (+ (div .cse12 (- 2)) |c_ULTIMATE.start_main_~x~0#1|) .cse12)) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ (div (let ((.cse13 (* (- 1) |c_ULTIMATE.start_main_~x~0#1|))) (+ (div (+ 4294967290 .cse13) 2) .cse13 2147483641)) 2) 1)) (<= .cse3 2147483648) (forall ((|aux_div_v_ULTIMATE.start_main_~x~0#1_85_70| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int)) (let ((.cse17 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse19 (+ 1 |c_ULTIMATE.start_main_~d2~0#1|)) (.cse18 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse15 (* 2 |aux_div_v_ULTIMATE.start_main_~x~0#1_85_70|)) (.cse16 (+ |c_ULTIMATE.start_main_~d1~0#1| .cse17)) (.cse14 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |c_ULTIMATE.start_main_~d1~0#1| .cse14)) (< (+ .cse15 |c_ULTIMATE.start_main_~d1~0#1| 4294967289) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| .cse16) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse14) .cse17) (<= (+ 2 .cse18) .cse15) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse19) (<= (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2 .cse15) .cse18) (<= |aux_div_v_ULTIMATE.start_main_~x~0#1_85_70| .cse19) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse18 2147483641)) (<= (+ 2147483643 .cse15) .cse16) (<= (+ 2 .cse17) .cse14) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2147483647 |c_ULTIMATE.start_main_~d1~0#1|) |c_ULTIMATE.start_main_~x~0#1|))))) (<= |c_ULTIMATE.start_main_~d1~0#1| 75))) is different from false [2022-07-23 13:20:24,513 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* 2 |c_ULTIMATE.start_main_~d1~0#1|))) (let ((.cse3 (* (- 1) |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~d2~0#1|)) (.cse4 (<= |c_ULTIMATE.start_main_~x~0#1| (+ 4294967289 .cse5)))) (and (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse1 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse0 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse0 (+ .cse1 2147483651)) (< (+ .cse1 2147483647) .cse0) (<= |c_ULTIMATE.start_main_~d1~0#1| (+ 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290)))) (<= 1 .cse2) (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~d1~0#1|) 4294967290 .cse3) (- 2)) |c_ULTIMATE.start_main_~x~0#1|) 2147483641) (<= 0 |c_ULTIMATE.start_main_~x~0#1|) (or .cse4 (not (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1|))) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse5 2147483648))) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse6 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse10 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse7 (+ 2 |c_ULTIMATE.start_main_~d1~0#1|)) (.cse11 (+ |c_ULTIMATE.start_main_~x~0#1| .cse10)) (.cse12 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1| .cse6)) (.cse8 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse13 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ .cse6 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse7) (<= (+ .cse8 |c_ULTIMATE.start_main_~d1~0#1| 2147483646) .cse9) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse10 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ |c_ULTIMATE.start_main_~d1~0#1| .cse6 2147483646) .cse11) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse7) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse12 |c_ULTIMATE.start_main_~d1~0#1|) .cse11) (<= (+ 6442450936 .cse12 |c_ULTIMATE.start_main_~d1~0#1| .cse13) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse6) .cse10) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse13) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483644 .cse13) |c_ULTIMATE.start_main_~d2~0#1|) (<= (+ 4294967291 .cse12 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse9) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse8 2147483641)) (<= (+ 2 .cse10) .cse6) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|) (<= (+ 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse13 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|))))) (<= |c_ULTIMATE.start_main_~d2~0#1| 74) (let ((.cse14 (+ |c_ULTIMATE.start_main_~d1~0#1| 2147483641))) (<= (+ (div .cse14 (- 2)) |c_ULTIMATE.start_main_~x~0#1|) .cse14)) (forall ((|aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| Int)) (let ((.cse18 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2)) (.cse20 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse15 (+ 2 |c_ULTIMATE.start_main_~d1~0#1|)) (.cse19 (+ |c_ULTIMATE.start_main_~x~0#1| .cse20)) (.cse21 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse17 (+ |c_ULTIMATE.start_main_~x~0#1| .cse18)) (.cse16 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse22 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse15) (<= (+ .cse16 |c_ULTIMATE.start_main_~d1~0#1| 2147483646) .cse17) (<= (+ |c_ULTIMATE.start_main_~d1~0#1| .cse18 2147483646) .cse19) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ 2 .cse20 |c_ULTIMATE.start_main_~d1old~0#1|)) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse15) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse21 |c_ULTIMATE.start_main_~d1~0#1|) .cse19) (<= (+ 6442450936 .cse21 |c_ULTIMATE.start_main_~d1~0#1| .cse22) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse18) .cse20) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ 2 |c_ULTIMATE.start_main_~d1old~0#1| .cse18)) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse22) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 4294967291 .cse21 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse17) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse16 2147483641)) (<= (+ 2147483643 .cse22) |c_ULTIMATE.start_main_~d1old~0#1|) (<= (+ 2 .cse20) .cse18) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|) (<= (+ 4294967291 |c_ULTIMATE.start_main_~d1~0#1| .cse22 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|))))) (exists ((|aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| Int) (|aux_div_ULTIMATE.start_main_~x~0#1_61| Int)) (let ((.cse24 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse23 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse23 (+ .cse24 2147483651)) (< (+ .cse24 2147483647) .cse23) (<= (* 2 |aux_div_ULTIMATE.start_main_~x~0#1_61|) 4294967290) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112| 1))))) (<= (+ |c_ULTIMATE.start_main_~x~0#1| (div (+ (* (- 1) |c_ULTIMATE.start_main_~d2~0#1|) .cse3 4294967289) (- 2))) 2147483641) (<= |c_ULTIMATE.start_main_~d2~0#1| (+ (div (+ (div (+ 4294967290 .cse3) 2) .cse3 2147483641) 2) 1)) (<= .cse2 2147483648) (or (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 .cse5 |c_ULTIMATE.start_main_~d2~0#1|)) .cse4) (forall ((|aux_div_v_ULTIMATE.start_main_~x~0#1_85_70| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| Int) (|aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| Int)) (let ((.cse28 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|))) (let ((.cse30 (+ 1 |c_ULTIMATE.start_main_~d2~0#1|)) (.cse29 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse26 (* 2 |aux_div_v_ULTIMATE.start_main_~x~0#1_85_70|)) (.cse27 (+ |c_ULTIMATE.start_main_~d1~0#1| .cse28)) (.cse25 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (or (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ |c_ULTIMATE.start_main_~d1~0#1| .cse25)) (< (+ .cse26 |c_ULTIMATE.start_main_~d1~0#1| 4294967289) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| .cse27) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse25) .cse28) (<= (+ 2 .cse29) .cse26) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse30) (<= (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1| |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2 .cse26) .cse29) (<= |aux_div_v_ULTIMATE.start_main_~x~0#1_85_70| .cse30) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse29 2147483641)) (<= (+ 2147483643 .cse26) .cse27) (<= (+ 2 .cse28) .cse25) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2147483647 |c_ULTIMATE.start_main_~d1~0#1|) |c_ULTIMATE.start_main_~x~0#1|))))) (<= |c_ULTIMATE.start_main_~d1~0#1| 75)))) is different from false