./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 6c24879c 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-?-6c24879 [2022-07-13 01:58:14,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:58:14,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:58:14,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:58:14,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:58:14,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:58:14,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:58:14,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:58:14,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:58:14,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:58:14,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:58:14,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:58:14,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:58:14,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:58:14,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:58:14,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:58:14,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:58:14,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:58:14,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:58:14,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:58:14,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:58:14,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:58:14,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:58:14,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:58:14,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:58:14,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:58:14,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:58:14,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:58:14,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:58:14,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:58:14,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:58:14,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:58:14,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:58:14,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:58:14,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:58:14,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:58:14,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:58:14,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:58:14,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:58:14,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:58:14,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:58:14,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:58:14,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-07-13 01:58:14,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:58:14,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:58:14,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:58:14,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:58:14,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:58:14,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:58:14,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:58:14,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:58:14,392 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:58:14,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:58:14,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:58:14,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:58:14,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:58:14,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 01:58:14,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:58:14,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 01:58:14,394 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 01:58:14,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 01:58:14,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:58:14,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 01:58:14,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:58:14,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:58:14,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:58:14,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:58:14,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:58:14,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:58:14,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 01:58:14,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:58:14,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:58:14,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 01:58:14,397 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-13 01:58:14,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:58:14,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:58:14,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:58:14,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:58:14,678 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:58:14,679 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-13 01:58:14,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460b93c32/a66f67aaeb1c43f1a95b55c9c502a483/FLAGa68b68c94 [2022-07-13 01:58:15,108 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:58:15,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Benghazi.c [2022-07-13 01:58:15,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460b93c32/a66f67aaeb1c43f1a95b55c9c502a483/FLAGa68b68c94 [2022-07-13 01:58:15,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460b93c32/a66f67aaeb1c43f1a95b55c9c502a483 [2022-07-13 01:58:15,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:58:15,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:58:15,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:58:15,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:58:15,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:58:15,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@514921f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15, skipping insertion in model container [2022-07-13 01:58:15,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:58:15,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:58:15,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:58:15,282 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:58:15,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:58:15,301 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:58:15,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15 WrapperNode [2022-07-13 01:58:15,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:58:15,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:58:15,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:58:15,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:58:15,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,327 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-07-13 01:58:15,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:58:15,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:58:15,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:58:15,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:58:15,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:58:15,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:58:15,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:58:15,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:58:15,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (1/1) ... [2022-07-13 01:58:15,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:58:15,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:15,376 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-13 01:58:15,385 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-13 01:58:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:58:15,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:58:15,463 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:58:15,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:58:15,552 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:58:15,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:58:15,558 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 01:58:15,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:58:15 BoogieIcfgContainer [2022-07-13 01:58:15,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:58:15,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:58:15,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:58:15,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:58:15,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:58:15" (1/3) ... [2022-07-13 01:58:15,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3a1e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:58:15, skipping insertion in model container [2022-07-13 01:58:15,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:58:15" (2/3) ... [2022-07-13 01:58:15,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3a1e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:58:15, skipping insertion in model container [2022-07-13 01:58:15,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:58:15" (3/3) ... [2022-07-13 01:58:15,573 INFO L111 eAbstractionObserver]: Analyzing ICFG Benghazi.c [2022-07-13 01:58:15,585 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:58:15,585 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-07-13 01:58:15,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:58:15,633 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@3198e378, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1069075a [2022-07-13 01:58:15,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 01:58:15,638 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-13 01:58:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-13 01:58:15,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:15,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-13 01:58:15,645 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-13 01:58:15,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-07-13 01:58:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194692878] [2022-07-13 01:58:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:15,803 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-13 01:58:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:15,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194692878] [2022-07-13 01:58:15,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194692878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:15,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:15,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:15,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830314417] [2022-07-13 01:58:15,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:15,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:15,851 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-13 01:58:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:15,906 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-07-13 01:58:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:15,921 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-13 01:58:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:15,927 INFO L225 Difference]: With dead ends: 31 [2022-07-13 01:58:15,931 INFO L226 Difference]: Without dead ends: 18 [2022-07-13 01:58:15,934 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-13 01:58:15,948 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-13 01:58:15,950 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-13 01:58:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-13 01:58:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-13 01:58:16,000 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-13 01:58:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-07-13 01:58:16,004 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2022-07-13 01:58:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,004 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-07-13 01:58:16,005 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-13 01:58:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-07-13 01:58:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:58:16,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:58:16,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 01:58:16,006 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-13 01:58:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-07-13 01:58:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:16,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585868202] [2022-07-13 01:58:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,069 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-13 01:58:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:16,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585868202] [2022-07-13 01:58:16,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585868202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:16,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:16,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726948334] [2022-07-13 01:58:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:16,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:16,076 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-13 01:58:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:16,120 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-07-13 01:58:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:58:16,121 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-13 01:58:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:16,122 INFO L225 Difference]: With dead ends: 23 [2022-07-13 01:58:16,122 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 01:58:16,122 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-13 01:58:16,124 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-13 01:58:16,124 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-13 01:58:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 01:58:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-07-13 01:58:16,128 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-13 01:58:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-07-13 01:58:16,129 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2022-07-13 01:58:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-07-13 01:58:16,130 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-13 01:58:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-07-13 01:58:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:58:16,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:58:16,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 01:58:16,132 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-13 01:58:16,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:16,134 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2022-07-13 01:58:16,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:16,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805987288] [2022-07-13 01:58:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,157 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-13 01:58:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805987288] [2022-07-13 01:58:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805987288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:16,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:16,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245279439] [2022-07-13 01:58:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:16,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:16,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:16,161 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-13 01:58:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:16,173 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-13 01:58:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:16,174 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-13 01:58:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:16,176 INFO L225 Difference]: With dead ends: 25 [2022-07-13 01:58:16,177 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 01:58:16,177 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-13 01:58:16,182 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-13 01:58:16,183 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-13 01:58:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 01:58:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-07-13 01:58:16,187 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-13 01:58:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-07-13 01:58:16,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 6 [2022-07-13 01:58:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,189 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-07-13 01:58:16,189 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-13 01:58:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-07-13 01:58:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 01:58:16,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:16,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 01:58:16,190 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-13 01:58:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2022-07-13 01:58:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:16,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434359087] [2022-07-13 01:58:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,212 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-13 01:58:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:16,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434359087] [2022-07-13 01:58:16,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434359087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:16,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:16,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379992571] [2022-07-13 01:58:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:16,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:16,216 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-13 01:58:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:16,228 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-07-13 01:58:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:16,229 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-13 01:58:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:16,230 INFO L225 Difference]: With dead ends: 25 [2022-07-13 01:58:16,230 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 01:58:16,230 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-13 01:58:16,231 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-13 01:58:16,232 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-13 01:58:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 01:58:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-13 01:58:16,236 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-13 01:58:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-07-13 01:58:16,237 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2022-07-13 01:58:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,237 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-07-13 01:58:16,237 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-13 01:58:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-07-13 01:58:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:58:16,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:16,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 01:58:16,239 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-13 01:58:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash 294943144, now seen corresponding path program 1 times [2022-07-13 01:58:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:16,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890629805] [2022-07-13 01:58:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,269 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-13 01:58:16,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:16,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890629805] [2022-07-13 01:58:16,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890629805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:16,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:16,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097186413] [2022-07-13 01:58:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:16,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:16,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:16,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:16,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:16,272 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-13 01:58:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:16,302 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-13 01:58:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:58:16,302 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-13 01:58:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:16,303 INFO L225 Difference]: With dead ends: 28 [2022-07-13 01:58:16,303 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 01:58:16,304 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-13 01:58:16,305 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-13 01:58:16,305 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-13 01:58:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 01:58:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-07-13 01:58:16,309 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-13 01:58:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-07-13 01:58:16,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2022-07-13 01:58:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,310 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-07-13 01:58:16,310 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-13 01:58:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-07-13 01:58:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 01:58:16,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:16,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 01:58:16,312 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-13 01:58:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 553302925, now seen corresponding path program 1 times [2022-07-13 01:58:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335452496] [2022-07-13 01:58:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,341 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-13 01:58:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335452496] [2022-07-13 01:58:16,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335452496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:16,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:16,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:58:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243578693] [2022-07-13 01:58:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:16,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:58:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:16,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:58:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:58:16,345 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-13 01:58:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:16,372 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-07-13 01:58:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:58:16,372 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-13 01:58:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:16,373 INFO L225 Difference]: With dead ends: 28 [2022-07-13 01:58:16,373 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 01:58:16,374 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-13 01:58:16,375 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-13 01:58:16,375 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-13 01:58:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 01:58:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-13 01:58:16,379 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-13 01:58:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-07-13 01:58:16,379 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 9 [2022-07-13 01:58:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,380 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-07-13 01:58:16,380 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-13 01:58:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-07-13 01:58:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:58:16,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,381 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 01:58:16,381 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-13 01:58:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -851832465, now seen corresponding path program 1 times [2022-07-13 01:58:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635670713] [2022-07-13 01:58:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,441 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-13 01:58:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:16,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635670713] [2022-07-13 01:58:16,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635670713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:16,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835628858] [2022-07-13 01:58:16,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:16,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:16,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:16,451 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-13 01:58:16,458 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-13 01:58:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:16,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:58:16,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:16,660 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-13 01:58:16,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:16,732 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-13 01:58:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835628858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:16,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:16,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-13 01:58:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756484871] [2022-07-13 01:58:16,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:16,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 01:58:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 01:58:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:58:16,736 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-13 01:58:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:16,830 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-13 01:58:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:58:16,831 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-13 01:58:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:16,832 INFO L225 Difference]: With dead ends: 31 [2022-07-13 01:58:16,832 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 01:58:16,834 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-13 01:58:16,835 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:16,835 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.1s Time] [2022-07-13 01:58:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 01:58:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-13 01:58:16,845 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-13 01:58:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-07-13 01:58:16,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2022-07-13 01:58:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:16,847 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-07-13 01:58:16,847 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-13 01:58:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-07-13 01:58:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 01:58:16,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:16,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:16,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 01:58:17,072 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-13 01:58:17,072 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-13 01:58:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash -637002594, now seen corresponding path program 1 times [2022-07-13 01:58:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:17,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309463604] [2022-07-13 01:58:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:17,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:17,121 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-13 01:58:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:17,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309463604] [2022-07-13 01:58:17,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309463604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117970056] [2022-07-13 01:58:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:17,125 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-13 01:58:17,126 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-13 01:58:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:17,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:58:17,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:17,193 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-13 01:58:17,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:17,232 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-13 01:58:17,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117970056] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:17,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:17,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 01:58:17,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14890377] [2022-07-13 01:58:17,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:17,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:58:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:17,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:58:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:58:17,235 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-13 01:58:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:17,341 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-13 01:58:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 01:58:17,341 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-13 01:58:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:17,342 INFO L225 Difference]: With dead ends: 29 [2022-07-13 01:58:17,342 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 01:58:17,343 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-13 01:58:17,344 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-13 01:58:17,344 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-13 01:58:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 01:58:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-07-13 01:58:17,347 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-13 01:58:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-07-13 01:58:17,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2022-07-13 01:58:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:17,348 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-07-13 01:58:17,348 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-13 01:58:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-07-13 01:58:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:58:17,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:17,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:17,378 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-13 01:58:17,564 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-13 01:58:17,564 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-13 01:58:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1727756113, now seen corresponding path program 1 times [2022-07-13 01:58:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:17,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440755452] [2022-07-13 01:58:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:17,592 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-13 01:58:17,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:17,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440755452] [2022-07-13 01:58:17,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440755452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:17,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805287532] [2022-07-13 01:58:17,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:17,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:17,594 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-13 01:58:17,615 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-13 01:58:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:17,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:58:17,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:17,659 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-13 01:58:17,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:17,688 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-13 01:58:17,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805287532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:17,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:17,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 01:58:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401682877] [2022-07-13 01:58:17,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:58:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:58:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:58:17,691 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-13 01:58:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:17,817 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-07-13 01:58:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:58:17,818 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-13 01:58:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:17,820 INFO L225 Difference]: With dead ends: 45 [2022-07-13 01:58:17,820 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 01:58:17,821 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-13 01:58:17,823 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-13 01:58:17,823 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-13 01:58:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 01:58:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-13 01:58:17,833 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-13 01:58:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-13 01:58:17,834 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 13 [2022-07-13 01:58:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:17,834 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-13 01:58:17,834 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-13 01:58:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-13 01:58:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 01:58:17,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:17,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 01:58:17,854 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-13 01:58:18,043 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-13 01:58:18,044 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-13 01:58:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2020832000, now seen corresponding path program 1 times [2022-07-13 01:58:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871100666] [2022-07-13 01:58:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:18,078 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-13 01:58:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:18,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871100666] [2022-07-13 01:58:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871100666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:58:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:58:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:58:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226306093] [2022-07-13 01:58:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:58:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:58:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:58:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:58:18,081 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-13 01:58:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:18,088 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-13 01:58:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:58:18,088 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-13 01:58:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:18,088 INFO L225 Difference]: With dead ends: 39 [2022-07-13 01:58:18,089 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 01:58:18,089 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-13 01:58:18,089 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-13 01:58:18,093 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-13 01:58:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 01:58:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-13 01:58:18,097 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-13 01:58:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-13 01:58:18,098 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2022-07-13 01:58:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:18,098 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-13 01:58:18,098 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-13 01:58:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-13 01:58:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 01:58:18,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:18,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 01:58:18,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 01:58:18,099 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-13 01:58:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash 694335842, now seen corresponding path program 1 times [2022-07-13 01:58:18,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:18,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829902819] [2022-07-13 01:58:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:18,142 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-13 01:58:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829902819] [2022-07-13 01:58:18,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829902819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090199541] [2022-07-13 01:58:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:18,184 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-13 01:58:18,185 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-13 01:58:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:18,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:58:18,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:18,228 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-13 01:58:18,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:18,262 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-13 01:58:18,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090199541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:18,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:18,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 01:58:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207690848] [2022-07-13 01:58:18,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:18,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:58:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:58:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:58:18,265 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-13 01:58:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:18,371 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-07-13 01:58:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:58:18,372 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-13 01:58:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:18,372 INFO L225 Difference]: With dead ends: 48 [2022-07-13 01:58:18,372 INFO L226 Difference]: Without dead ends: 47 [2022-07-13 01:58:18,373 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-13 01:58:18,373 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-13 01:58:18,374 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-13 01:58:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-13 01:58:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-07-13 01:58:18,380 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-13 01:58:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-07-13 01:58:18,380 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2022-07-13 01:58:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:18,381 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-07-13 01:58:18,381 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-13 01:58:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-07-13 01:58:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 01:58:18,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:18,382 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-13 01:58:18,411 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-13 01:58:18,582 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-13 01:58:18,582 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-13 01:58:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1536814596, now seen corresponding path program 2 times [2022-07-13 01:58:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209660432] [2022-07-13 01:58:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:18,643 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-13 01:58:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:18,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209660432] [2022-07-13 01:58:18,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209660432] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:18,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878336064] [2022-07-13 01:58:18,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:58:18,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:18,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:18,645 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-13 01:58:18,661 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-13 01:58:18,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:58:18,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:58:18,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 01:58:18,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:18,841 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-13 01:58:18,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:18,954 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-13 01:58:18,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878336064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:18,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:18,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-07-13 01:58:18,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140520440] [2022-07-13 01:58:18,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 01:58:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:18,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 01:58:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:58:18,957 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-13 01:58:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:19,057 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-07-13 01:58:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:58:19,057 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-13 01:58:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:19,058 INFO L225 Difference]: With dead ends: 37 [2022-07-13 01:58:19,058 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 01:58:19,058 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-13 01:58:19,059 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-13 01:58:19,059 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-13 01:58:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 01:58:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-13 01:58:19,063 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-13 01:58:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-07-13 01:58:19,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 18 [2022-07-13 01:58:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-07-13 01:58:19,065 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-13 01:58:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-07-13 01:58:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 01:58:19,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:19,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2022-07-13 01:58:19,094 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-13 01:58:19,291 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-13 01:58:19,292 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-13 01:58:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 906255251, now seen corresponding path program 1 times [2022-07-13 01:58:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:19,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962985122] [2022-07-13 01:58:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:19,369 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-13 01:58:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962985122] [2022-07-13 01:58:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962985122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168554626] [2022-07-13 01:58:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:19,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:19,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:19,376 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-13 01:58:19,405 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-13 01:58:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:19,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:58:19,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:19,456 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-13 01:58:19,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:19,532 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-13 01:58:19,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168554626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:19,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:19,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-13 01:58:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420029057] [2022-07-13 01:58:19,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:19,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:58:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:58:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:58:19,534 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-13 01:58:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:19,734 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-07-13 01:58:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 01:58:19,734 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-13 01:58:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:19,739 INFO L225 Difference]: With dead ends: 69 [2022-07-13 01:58:19,739 INFO L226 Difference]: Without dead ends: 67 [2022-07-13 01:58:19,740 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-13 01:58:19,741 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-13 01:58:19,741 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-13 01:58:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-13 01:58:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-07-13 01:58:19,753 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-13 01:58:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-07-13 01:58:19,753 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 29 [2022-07-13 01:58:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:19,754 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-07-13 01:58:19,754 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-13 01:58:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-07-13 01:58:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 01:58:19,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:19,755 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 1, 1, 1] [2022-07-13 01:58:19,784 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-13 01:58:19,975 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-13 01:58:19,976 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-13 01:58:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2015761009, now seen corresponding path program 2 times [2022-07-13 01:58:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399696543] [2022-07-13 01:58:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:20,084 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-13 01:58:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:20,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399696543] [2022-07-13 01:58:20,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399696543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:20,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678308424] [2022-07-13 01:58:20,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:58:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:20,086 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-13 01:58:20,094 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-13 01:58:20,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:58:20,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:58:20,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 01:58:20,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:20,202 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-13 01:58:20,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:20,400 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-13 01:58:20,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678308424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:20,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:20,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-13 01:58:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259128123] [2022-07-13 01:58:20,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:20,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:58:20,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:58:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:58:20,402 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-13 01:58:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:20,905 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-07-13 01:58:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 01:58:20,906 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-13 01:58:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:20,907 INFO L225 Difference]: With dead ends: 122 [2022-07-13 01:58:20,907 INFO L226 Difference]: Without dead ends: 120 [2022-07-13 01:58:20,908 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-13 01:58:20,908 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:58:20,909 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.2s Time] [2022-07-13 01:58:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-13 01:58:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-13 01:58:20,922 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-13 01:58:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2022-07-13 01:58:20,927 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 55 [2022-07-13 01:58:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:20,928 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2022-07-13 01:58:20,929 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-13 01:58:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-07-13 01:58:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 01:58:20,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:20,933 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 1, 1, 1] [2022-07-13 01:58:20,961 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-13 01:58:21,147 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-13 01:58:21,148 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-13 01:58:21,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 875637203, now seen corresponding path program 2 times [2022-07-13 01:58:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:21,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116170148] [2022-07-13 01:58:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:21,462 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-13 01:58:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116170148] [2022-07-13 01:58:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116170148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388500603] [2022-07-13 01:58:21,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:58:21,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:21,468 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-13 01:58:21,503 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-13 01:58:21,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:58:21,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:58:21,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:58:21,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:21,692 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-13 01:58:21,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:22,236 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-13 01:58:22,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388500603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:22,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:22,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-13 01:58:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185225688] [2022-07-13 01:58:22,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:22,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:58:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:58:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:58:22,239 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-13 01:58:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:23,616 INFO L93 Difference]: Finished difference Result 237 states and 267 transitions. [2022-07-13 01:58:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 01:58:23,617 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-13 01:58:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:23,618 INFO L225 Difference]: With dead ends: 237 [2022-07-13 01:58:23,618 INFO L226 Difference]: Without dead ends: 235 [2022-07-13 01:58:23,622 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-13 01:58:23,622 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-13 01:58:23,623 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-13 01:58:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-13 01:58:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2022-07-13 01:58:23,647 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-13 01:58:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2022-07-13 01:58:23,648 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 113 [2022-07-13 01:58:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:23,649 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2022-07-13 01:58:23,650 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-13 01:58:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2022-07-13 01:58:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-13 01:58:23,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:23,656 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 1, 1, 1] [2022-07-13 01:58:23,680 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-13 01:58:23,875 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-13 01:58:23,876 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-13 01:58:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash 863858417, now seen corresponding path program 3 times [2022-07-13 01:58:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824297744] [2022-07-13 01:58:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:24,828 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-13 01:58:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824297744] [2022-07-13 01:58:24,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824297744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096685286] [2022-07-13 01:58:24,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:58:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:24,830 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-13 01:58:24,866 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-13 01:58:24,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-13 01:58:24,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:58:24,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 01:58:24,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:25,711 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-13 01:58:25,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:58:29,437 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-13 01:58:29,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096685286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:58:29,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:58:29,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 19, 20] total 85 [2022-07-13 01:58:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213649834] [2022-07-13 01:58:29,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:58:29,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-13 01:58:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:58:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-13 01:58:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=6585, Unknown=1, NotChecked=0, Total=7310 [2022-07-13 01:58:29,442 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-13 01:58:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:58:52,024 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2022-07-13 01:58:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2022-07-13 01:58:52,025 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-13 01:58:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:58:52,027 INFO L225 Difference]: With dead ends: 235 [2022-07-13 01:58:52,027 INFO L226 Difference]: Without dead ends: 234 [2022-07-13 01:58:52,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17101 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=13177, Invalid=49572, Unknown=1, NotChecked=0, Total=62750 [2022-07-13 01:58:52,038 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-13 01:58:52,038 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-13 01:58:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-13 01:58:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2022-07-13 01:58:52,053 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-13 01:58:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2022-07-13 01:58:52,053 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 223 [2022-07-13 01:58:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:58:52,054 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2022-07-13 01:58:52,054 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-13 01:58:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2022-07-13 01:58:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-13 01:58:52,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:58:52,056 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 1, 1, 1] [2022-07-13 01:58:52,079 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-13 01:58:52,275 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-13 01:58:52,275 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-13 01:58:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:58:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1072370600, now seen corresponding path program 3 times [2022-07-13 01:58:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:58:52,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193014207] [2022-07-13 01:58:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:58:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:58:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:58:53,113 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-13 01:58:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:58:53,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193014207] [2022-07-13 01:58:53,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193014207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:58:53,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089696061] [2022-07-13 01:58:53,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:58:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 01:58:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:58:53,115 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-13 01:58:53,118 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-13 01:58:53,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-13 01:58:53,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:58:53,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 01:58:53,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:58:55,415 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-13 01:58:56,663 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-13 01:58:57,765 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-13 01:58:57,786 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-13 01:58:57,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:59:15,583 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-13 01:59:15,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089696061] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:59:15,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 01:59:15,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 103 [2022-07-13 01:59:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217081318] [2022-07-13 01:59:15,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 01:59:15,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-13 01:59:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-13 01:59:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=836, Invalid=9269, Unknown=7, NotChecked=600, Total=10712 [2022-07-13 01:59:15,586 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-13 01:59:17,814 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-13 02:00:00,867 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 140 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:00:03,131 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 |c_ULTIMATE.start_main_~d1~0#1|))) (let ((.cse1 (<= |c_ULTIMATE.start_main_~x~0#1| (+ 4294967289 .cse0))) (.cse2 (not (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 |c_ULTIMATE.start_main_~d1~0#1|)))) (.cse3 (* (- 1) |c_ULTIMATE.start_main_~x~0#1|)) (.cse18 (+ |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~d1old~0#1|))) (and (or (<= |c_ULTIMATE.start_main_~x~0#1| (+ 2147483647 .cse0 |c_ULTIMATE.start_main_~d2~0#1|)) .cse1 .cse2) (<= (+ |c_ULTIMATE.start_main_~x~0#1| (* 2 |c_ULTIMATE.start_main_~d1old~0#1|)) (+ (div (+ 4294967290 .cse3) 2) 2147483641)) (or .cse1 .cse2 (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse0 2147483648))) (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 ((.cse6 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~x~0#1| .cse6)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse10 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse11 (+ 3 |c_ULTIMATE.start_main_~d2~0#1|)) (.cse9 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse4 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse5 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2))) (or (<= (+ 6442450933 .cse4 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse5) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483643 .cse6) .cse7) (<= (+ 2147483643 (* 3 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) .cse8) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ 2 .cse9 |c_ULTIMATE.start_main_~d1old~0#1|)) (<= (+ 4294967288 .cse4 .cse10) .cse8) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse6) .cse9) (<= (+ 4294967288 .cse10 .cse5) |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 .cse4) .cse7) (<= (+ |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| .cse5) |c_ULTIMATE.start_main_~x~0#1|) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse11) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ 2 |c_ULTIMATE.start_main_~d1old~0#1| .cse6)) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse10 2147483641)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse11) (<= (+ 2147483643 .cse5) |c_ULTIMATE.start_main_~d1old~0#1|) (<= (+ 2 .cse9) .cse6) (<= (+ 6442450933 .cse4 .cse5 |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 ((.cse12 (div (+ |c_ULTIMATE.start_main_~d1old~0#1| .cse3 2147483648) (- 2))) (.cse14 (div (+ .cse3 4294967289) (- 2))) (.cse13 (+ 1 |c_ULTIMATE.start_main_~d2~0#1|))) (or (<= (+ .cse12 2147483647) |c_ULTIMATE.start_main_~x~0#1|) (<= .cse12 .cse13) (<= (+ .cse14 2147483647) |c_ULTIMATE.start_main_~x~0#1|) (<= .cse14 .cse13))) (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 ((.cse16 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~x~0#1_61_112|)) (.cse15 (* 3 |aux_div_ULTIMATE.start_main_~x~0#1_61|))) (and (< .cse15 (+ .cse16 2147483651)) (< (+ .cse16 2147483647) .cse15) (<= (* 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_~d1~0#1| 73) (let ((.cse17 (+ 2147483642 |c_ULTIMATE.start_main_~d2~0#1|))) (<= (+ |c_ULTIMATE.start_main_~x~0#1| (div .cse17 (- 2))) .cse17)) (<= .cse18 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 ((.cse24 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168|)) (.cse21 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 2))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~x~0#1| .cse21)) (.cse25 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~d1~0#1_64_100_169| 2)) (.cse22 (* 2 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (.cse20 (+ 2 |c_ULTIMATE.start_main_~d1old~0#1|)) (.cse19 (* 2 |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|)) (.cse26 (+ |c_ULTIMATE.start_main_~x~0#1| .cse24))) (or (< |c_ULTIMATE.start_main_~x~0#1| (+ 4294967291 .cse19 |c_ULTIMATE.start_main_~d2~0#1|)) (<= |aux_div_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168| .cse20) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| (+ .cse21 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ .cse22 2147483646) .cse23) (<= |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| (+ .cse24 1 |c_ULTIMATE.start_main_~d2~0#1|)) (<= (+ 6442450936 .cse19 .cse25) |c_ULTIMATE.start_main_~x~0#1|) (<= 0 (+ 2147483641 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|)) (<= (+ 2 .cse21) .cse24) (< |c_ULTIMATE.start_main_~x~0#1| (+ 6442450933 .cse19 .cse25)) (<= |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|)) (<= (+ .cse21 2147483646) .cse26) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse25) |c_ULTIMATE.start_main_~x~0#1|) (<= (+ 2147483644 .cse25) |c_ULTIMATE.start_main_~d2~0#1|) (<= (+ 4294967291 .cse19 |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198|) .cse23) (<= (+ 4294967291 .cse25 |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| (+ .cse22 2147483641)) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| .cse20) (<= (+ 2 .cse24) .cse21) (<= (+ |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~x~0#1_85_70_168_139| 4294967291 .cse19) .cse26) (<= |aux_div_v_ULTIMATE.start_main_~d1old~0#1_65_198| |aux_div_v_ULTIMATE.start_main_~d1~0#1_64_100|))))) (<= 0 .cse18)))) is different from false [2022-07-13 02:00:05,216 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-13 02:01:08,698 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 131 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:01:10,802 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-13 02:01:43,258 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