/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/double_req_bl_0971.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:01:08,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:01:08,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:01:08,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:01:08,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:01:08,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:01:08,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:01:08,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:01:08,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:01:08,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:01:08,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:01:08,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:01:08,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:01:08,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:01:08,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:01:08,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:01:08,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:01:08,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:01:08,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:01:08,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:01:08,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:01:08,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:01:08,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:01:08,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:01:08,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:01:08,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:01:08,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:01:08,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:01:08,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:01:08,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:01:08,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:01:08,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:01:08,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:01:08,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:01:08,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:01:08,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:01:08,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:01:08,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:01:08,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:01:08,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:01:08,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:01:08,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 12:01:08,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:01:08,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:01:08,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:01:08,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:01:08,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:01:08,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:01:08,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:01:08,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:01:08,561 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:01:08,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:01:08,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:01:08,563 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:01:08,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:01:08,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:01:08,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:01:08,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:01:08,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:01:08,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:01:08,564 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:01:08,564 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:01:08,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:01:08,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:01:08,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:01:08,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:01:08,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:01:08,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:01:08,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:01:08,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:01:08,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:01:08,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:01:08,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:01:08,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:01:08,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:01:08,567 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 [2022-10-16 12:01:09,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:01:09,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:01:09,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:01:09,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:01:09,062 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:01:09,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0971.c [2022-10-16 12:01:09,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5049acc/b7b98b2eb3804d76bcaeb500480a71eb/FLAG69c8a80c0 [2022-10-16 12:01:09,779 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:01:09,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0971.c [2022-10-16 12:01:09,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5049acc/b7b98b2eb3804d76bcaeb500480a71eb/FLAG69c8a80c0 [2022-10-16 12:01:09,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5049acc/b7b98b2eb3804d76bcaeb500480a71eb [2022-10-16 12:01:09,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:01:09,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:01:09,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:01:09,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:01:09,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:01:09,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:09" (1/1) ... [2022-10-16 12:01:09,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2526fe08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:09, skipping insertion in model container [2022-10-16 12:01:09,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:09" (1/1) ... [2022-10-16 12:01:09,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:01:09,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:01:10,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0971.c[4582,4595] [2022-10-16 12:01:10,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:01:10,266 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:01:10,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0971.c[4582,4595] [2022-10-16 12:01:10,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:01:10,329 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:01:10,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10 WrapperNode [2022-10-16 12:01:10,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:01:10,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:01:10,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:01:10,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:01:10,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,404 INFO L138 Inliner]: procedures = 18, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 272 [2022-10-16 12:01:10,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:01:10,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:01:10,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:01:10,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:01:10,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:01:10,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:01:10,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:01:10,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:01:10,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (1/1) ... [2022-10-16 12:01:10,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:01:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:01:10,531 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-10-16 12:01:10,552 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-10-16 12:01:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:01:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:01:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:01:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:01:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:01:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:01:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:01:10,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:01:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:01:10,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:01:10,735 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:01:10,738 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:01:11,505 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:01:11,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:01:11,515 INFO L300 CfgBuilder]: Removed 12 assume(true) statements. [2022-10-16 12:01:11,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:11 BoogieIcfgContainer [2022-10-16 12:01:11,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:01:11,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:01:11,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:01:11,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:01:11,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:01:09" (1/3) ... [2022-10-16 12:01:11,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649398fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:11, skipping insertion in model container [2022-10-16 12:01:11,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:10" (2/3) ... [2022-10-16 12:01:11,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649398fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:11, skipping insertion in model container [2022-10-16 12:01:11,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:11" (3/3) ... [2022-10-16 12:01:11,530 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0971.c [2022-10-16 12:01:11,562 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:01:11,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-16 12:01:11,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:01:11,651 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fa94c81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:01:11,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-16 12:01:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 110 states have internal predecessors, (146), 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-10-16 12:01:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 12:01:11,665 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:11,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:11,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1812567146, now seen corresponding path program 1 times [2022-10-16 12:01:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:11,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089303750] [2022-10-16 12:01:11,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089303750] [2022-10-16 12:01:11,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089303750] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:11,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:11,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281948994] [2022-10-16 12:01:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:11,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:01:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:01:11,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:01:11,938 INFO L87 Difference]: Start difference. First operand has 111 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 110 states have internal predecessors, (146), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-10-16 12:01:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:11,997 INFO L93 Difference]: Finished difference Result 220 states and 290 transitions. [2022-10-16 12:01:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:01:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-10-16 12:01:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:12,011 INFO L225 Difference]: With dead ends: 220 [2022-10-16 12:01:12,012 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 12:01:12,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:01:12,020 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:12,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 12:01:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-16 12:01:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 97 states have internal predecessors, (105), 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-10-16 12:01:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-10-16 12:01:12,068 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 7 [2022-10-16 12:01:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:12,069 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-10-16 12:01:12,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-10-16 12:01:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-10-16 12:01:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 12:01:12,070 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:12,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:12,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:01:12,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 149055751, now seen corresponding path program 1 times [2022-10-16 12:01:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:12,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742741607] [2022-10-16 12:01:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742741607] [2022-10-16 12:01:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742741607] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:12,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:12,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027624799] [2022-10-16 12:01:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:12,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:12,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:12,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:12,273 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-10-16 12:01:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:12,359 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2022-10-16 12:01:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:12,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-10-16 12:01:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:12,362 INFO L225 Difference]: With dead ends: 153 [2022-10-16 12:01:12,363 INFO L226 Difference]: Without dead ends: 152 [2022-10-16 12:01:12,363 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-10-16 12:01:12,365 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 90 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:12,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 146 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-10-16 12:01:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 97. [2022-10-16 12:01:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 96 states have internal predecessors, (104), 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-10-16 12:01:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-10-16 12:01:12,380 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 8 [2022-10-16 12:01:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:12,380 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-10-16 12:01:12,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-10-16 12:01:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-10-16 12:01:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 12:01:12,382 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:12,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:12,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:01:12,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash 324898222, now seen corresponding path program 1 times [2022-10-16 12:01:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354720165] [2022-10-16 12:01:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354720165] [2022-10-16 12:01:12,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354720165] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:12,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:12,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:12,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242879980] [2022-10-16 12:01:12,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:12,502 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-10-16 12:01:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:12,535 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-10-16 12:01:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-10-16 12:01:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:12,538 INFO L225 Difference]: With dead ends: 105 [2022-10-16 12:01:12,538 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 12:01:12,538 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-10-16 12:01:12,540 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:12,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 182 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 12:01:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2022-10-16 12:01:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 94 states have internal predecessors, (102), 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-10-16 12:01:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-10-16 12:01:12,552 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 9 [2022-10-16 12:01:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:12,553 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-10-16 12:01:12,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-10-16 12:01:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-10-16 12:01:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 12:01:12,554 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:12,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:12,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:01:12,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 325761071, now seen corresponding path program 1 times [2022-10-16 12:01:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:12,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090208582] [2022-10-16 12:01:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:12,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090208582] [2022-10-16 12:01:12,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090208582] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:12,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:12,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834035106] [2022-10-16 12:01:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:12,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:12,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:12,679 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-10-16 12:01:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:12,794 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-10-16 12:01:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-10-16 12:01:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:12,805 INFO L225 Difference]: With dead ends: 178 [2022-10-16 12:01:12,805 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 12:01:12,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:12,808 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 82 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:12,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 221 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 12:01:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 98. [2022-10-16 12:01:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 97 states have internal predecessors, (105), 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-10-16 12:01:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-10-16 12:01:12,829 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 9 [2022-10-16 12:01:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:12,829 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-10-16 12:01:12,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-10-16 12:01:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-10-16 12:01:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:01:12,834 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:12,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:12,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:01:12,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1508658697, now seen corresponding path program 1 times [2022-10-16 12:01:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:12,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865518133] [2022-10-16 12:01:12,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865518133] [2022-10-16 12:01:12,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865518133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:12,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:12,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:01:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886069130] [2022-10-16 12:01:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:12,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:01:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:12,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:01:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:12,941 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-10-16 12:01:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:12,986 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-10-16 12:01:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:01:12,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-10-16 12:01:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:12,988 INFO L225 Difference]: With dead ends: 102 [2022-10-16 12:01:12,988 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 12:01:12,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:12,991 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:12,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 12:01:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-10-16 12:01:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 98 states have internal predecessors, (106), 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-10-16 12:01:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-16 12:01:13,001 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 10 [2022-10-16 12:01:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:13,002 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-16 12:01:13,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-10-16 12:01:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-16 12:01:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:01:13,003 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:13,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:13,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:01:13,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash -476220559, now seen corresponding path program 1 times [2022-10-16 12:01:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730603168] [2022-10-16 12:01:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:13,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730603168] [2022-10-16 12:01:13,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730603168] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:13,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:13,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:01:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586931027] [2022-10-16 12:01:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:01:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:01:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:13,129 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-16 12:01:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:13,206 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-10-16 12:01:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:01:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-16 12:01:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:13,209 INFO L225 Difference]: With dead ends: 101 [2022-10-16 12:01:13,209 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 12:01:13,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:13,211 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:13,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 252 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 12:01:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-16 12:01:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 states have internal predecessors, (107), 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-10-16 12:01:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-10-16 12:01:13,220 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 11 [2022-10-16 12:01:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:13,221 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-10-16 12:01:13,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-10-16 12:01:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-10-16 12:01:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:01:13,222 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:13,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:13,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:01:13,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1877935349, now seen corresponding path program 1 times [2022-10-16 12:01:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676463633] [2022-10-16 12:01:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:13,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:13,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676463633] [2022-10-16 12:01:13,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676463633] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:13,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:13,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019819715] [2022-10-16 12:01:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:13,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:13,438 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-16 12:01:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:13,483 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-10-16 12:01:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-16 12:01:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:13,486 INFO L225 Difference]: With dead ends: 100 [2022-10-16 12:01:13,487 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 12:01:13,487 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-10-16 12:01:13,493 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:13,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 12:01:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-10-16 12:01:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 95 states have internal predecessors, (103), 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-10-16 12:01:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-10-16 12:01:13,520 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 12 [2022-10-16 12:01:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:13,523 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-10-16 12:01:13,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-16 12:01:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-10-16 12:01:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 12:01:13,524 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:13,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:13,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:01:13,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1913546419, now seen corresponding path program 1 times [2022-10-16 12:01:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:13,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816594246] [2022-10-16 12:01:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:13,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816594246] [2022-10-16 12:01:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816594246] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:13,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:13,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138643060] [2022-10-16 12:01:13,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:13,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:13,797 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:13,832 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-10-16 12:01:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 12:01:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:13,835 INFO L225 Difference]: With dead ends: 151 [2022-10-16 12:01:13,835 INFO L226 Difference]: Without dead ends: 92 [2022-10-16 12:01:13,836 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-10-16 12:01:13,838 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:13,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 93 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-16 12:01:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-10-16 12:01:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.352112676056338) internal successors, (96), 91 states have internal predecessors, (96), 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-10-16 12:01:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-10-16 12:01:13,856 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 13 [2022-10-16 12:01:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:13,860 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-10-16 12:01:13,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-10-16 12:01:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:13,869 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:13,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:13,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:01:13,870 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1974752960, now seen corresponding path program 1 times [2022-10-16 12:01:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:13,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558694902] [2022-10-16 12:01:13,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558694902] [2022-10-16 12:01:14,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558694902] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:14,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:14,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212059200] [2022-10-16 12:01:14,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:14,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:14,015 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-10-16 12:01:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:14,053 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-10-16 12:01:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 12:01:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:14,055 INFO L225 Difference]: With dead ends: 92 [2022-10-16 12:01:14,055 INFO L226 Difference]: Without dead ends: 91 [2022-10-16 12:01:14,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:14,059 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 82 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:14,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 74 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-16 12:01:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-10-16 12:01:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 90 states have internal predecessors, (95), 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-10-16 12:01:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-10-16 12:01:14,072 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 15 [2022-10-16 12:01:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:14,076 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-10-16 12:01:14,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-10-16 12:01:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-10-16 12:01:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:01:14,078 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:14,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:14,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:01:14,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1087799528, now seen corresponding path program 1 times [2022-10-16 12:01:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:14,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051800556] [2022-10-16 12:01:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:14,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-10-16 12:01:14,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:14,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051800556] [2022-10-16 12:01:14,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051800556] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:14,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:14,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:01:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870775254] [2022-10-16 12:01:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:14,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:01:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:01:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:01:14,219 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-16 12:01:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:14,310 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-10-16 12:01:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:01:14,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-16 12:01:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:14,312 INFO L225 Difference]: With dead ends: 91 [2022-10-16 12:01:14,313 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 12:01:14,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:14,314 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:14,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 292 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 12:01:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-10-16 12:01:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.323943661971831) internal successors, (94), 89 states have internal predecessors, (94), 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-10-16 12:01:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-10-16 12:01:14,322 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 16 [2022-10-16 12:01:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:14,322 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-10-16 12:01:14,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-16 12:01:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-10-16 12:01:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:01:14,323 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:14,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:14,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:01:14,343 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 637953090, now seen corresponding path program 1 times [2022-10-16 12:01:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:14,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200730120] [2022-10-16 12:01:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:14,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:14,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:14,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200730120] [2022-10-16 12:01:14,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200730120] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:14,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:14,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:01:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387937240] [2022-10-16 12:01:14,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:14,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:01:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:14,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:01:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:01:14,509 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-10-16 12:01:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:14,599 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-10-16 12:01:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:01:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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) Word has length 17 [2022-10-16 12:01:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:14,601 INFO L225 Difference]: With dead ends: 90 [2022-10-16 12:01:14,602 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 12:01:14,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:14,604 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 16 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:14,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 283 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 12:01:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-10-16 12:01:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 83 states have internal predecessors, (88), 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-10-16 12:01:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-10-16 12:01:14,625 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 17 [2022-10-16 12:01:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:14,625 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-10-16 12:01:14,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-10-16 12:01:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-10-16 12:01:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 12:01:14,628 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:14,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:14,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:01:14,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1667011870, now seen corresponding path program 1 times [2022-10-16 12:01:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:14,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622192952] [2022-10-16 12:01:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:14,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:14,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:14,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622192952] [2022-10-16 12:01:14,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622192952] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:14,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:14,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:01:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268395437] [2022-10-16 12:01:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:14,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:01:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:01:14,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:01:14,817 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-10-16 12:01:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:14,930 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2022-10-16 12:01:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:01:14,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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) Word has length 24 [2022-10-16 12:01:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:14,932 INFO L225 Difference]: With dead ends: 156 [2022-10-16 12:01:14,932 INFO L226 Difference]: Without dead ends: 155 [2022-10-16 12:01:14,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:14,933 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:14,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 255 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-10-16 12:01:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 102. [2022-10-16 12:01:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 101 states have internal predecessors, (107), 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-10-16 12:01:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-10-16 12:01:14,940 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 24 [2022-10-16 12:01:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:14,940 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-10-16 12:01:14,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-10-16 12:01:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-10-16 12:01:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 12:01:14,942 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:14,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:14,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 12:01:14,943 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 137760549, now seen corresponding path program 1 times [2022-10-16 12:01:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:14,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424452262] [2022-10-16 12:01:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:15,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424452262] [2022-10-16 12:01:15,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424452262] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:15,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:15,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:01:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258554668] [2022-10-16 12:01:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:15,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:01:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:01:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:01:15,067 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-10-16 12:01:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:15,169 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2022-10-16 12:01:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:01:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 25 [2022-10-16 12:01:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:15,172 INFO L225 Difference]: With dead ends: 155 [2022-10-16 12:01:15,172 INFO L226 Difference]: Without dead ends: 154 [2022-10-16 12:01:15,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:15,173 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 147 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:15,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 255 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-16 12:01:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 103. [2022-10-16 12:01:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 102 states have internal predecessors, (108), 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-10-16 12:01:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2022-10-16 12:01:15,180 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 25 [2022-10-16 12:01:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:15,181 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2022-10-16 12:01:15,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-10-16 12:01:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2022-10-16 12:01:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 12:01:15,182 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:15,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:15,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 12:01:15,183 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1660207123, now seen corresponding path program 1 times [2022-10-16 12:01:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65119742] [2022-10-16 12:01:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:15,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:15,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65119742] [2022-10-16 12:01:15,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65119742] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:15,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:15,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:01:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194246122] [2022-10-16 12:01:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:15,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:01:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:01:15,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:15,348 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-10-16 12:01:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:15,531 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2022-10-16 12:01:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:01:15,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 30 [2022-10-16 12:01:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:15,533 INFO L225 Difference]: With dead ends: 154 [2022-10-16 12:01:15,533 INFO L226 Difference]: Without dead ends: 153 [2022-10-16 12:01:15,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-10-16 12:01:15,535 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 144 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:15,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 634 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-16 12:01:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2022-10-16 12:01:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 101 states have internal predecessors, (107), 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-10-16 12:01:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-10-16 12:01:15,544 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 30 [2022-10-16 12:01:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:15,544 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-10-16 12:01:15,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-10-16 12:01:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-10-16 12:01:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 12:01:15,554 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:15,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:15,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 12:01:15,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash 73186870, now seen corresponding path program 1 times [2022-10-16 12:01:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:15,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57557865] [2022-10-16 12:01:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:15,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57557865] [2022-10-16 12:01:15,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57557865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:15,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:15,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:01:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285366518] [2022-10-16 12:01:15,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:15,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:01:15,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:01:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:15,789 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-10-16 12:01:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:15,898 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-10-16 12:01:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:01:15,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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 31 [2022-10-16 12:01:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:15,900 INFO L225 Difference]: With dead ends: 102 [2022-10-16 12:01:15,900 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 12:01:15,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-16 12:01:15,902 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:15,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 188 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 12:01:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2022-10-16 12:01:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.303030303030303) internal successors, (86), 81 states have internal predecessors, (86), 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-10-16 12:01:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-10-16 12:01:15,908 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 31 [2022-10-16 12:01:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:15,909 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-10-16 12:01:15,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-10-16 12:01:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-10-16 12:01:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 12:01:15,910 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:15,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:15,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 12:01:15,910 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -824652180, now seen corresponding path program 1 times [2022-10-16 12:01:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:15,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62968367] [2022-10-16 12:01:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62968367] [2022-10-16 12:01:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62968367] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:15,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:15,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454443078] [2022-10-16 12:01:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:15,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:15,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:15,993 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-10-16 12:01:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:16,057 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-10-16 12:01:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2022-10-16 12:01:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:16,059 INFO L225 Difference]: With dead ends: 98 [2022-10-16 12:01:16,059 INFO L226 Difference]: Without dead ends: 93 [2022-10-16 12:01:16,059 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-10-16 12:01:16,060 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:16,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-16 12:01:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-10-16 12:01:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-10-16 12:01:16,068 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 34 [2022-10-16 12:01:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:16,068 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-10-16 12:01:16,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-10-16 12:01:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-10-16 12:01:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 12:01:16,069 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:16,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:16,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 12:01:16,070 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 204723545, now seen corresponding path program 1 times [2022-10-16 12:01:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:16,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582795428] [2022-10-16 12:01:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01: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-10-16 12:01:16,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:16,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582795428] [2022-10-16 12:01:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582795428] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:16,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:16,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565875572] [2022-10-16 12:01:16,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:16,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:16,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:16,160 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-10-16 12:01:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:16,185 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-10-16 12:01:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-16 12:01:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:16,187 INFO L225 Difference]: With dead ends: 99 [2022-10-16 12:01:16,187 INFO L226 Difference]: Without dead ends: 97 [2022-10-16 12:01:16,188 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-10-16 12:01:16,189 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:16,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 144 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-16 12:01:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-10-16 12:01:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 88 states have internal predecessors, (97), 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-10-16 12:01:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-10-16 12:01:16,196 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 35 [2022-10-16 12:01:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:16,197 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-10-16 12:01:16,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-10-16 12:01:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-10-16 12:01:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 12:01:16,198 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:16,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:16,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 12:01:16,198 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 205586394, now seen corresponding path program 1 times [2022-10-16 12:01:16,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:16,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963973846] [2022-10-16 12:01:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963973846] [2022-10-16 12:01:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963973846] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:16,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:16,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048046808] [2022-10-16 12:01:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:16,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:16,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:16,286 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-10-16 12:01:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:16,342 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-10-16 12:01:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-10-16 12:01:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:16,360 INFO L225 Difference]: With dead ends: 97 [2022-10-16 12:01:16,361 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 12:01:16,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:16,362 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:16,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 12:01:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-10-16 12:01:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 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-10-16 12:01:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-10-16 12:01:16,370 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 35 [2022-10-16 12:01:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:16,370 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-10-16 12:01:16,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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-10-16 12:01:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-10-16 12:01:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 12:01:16,371 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:16,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:16,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 12:01:16,372 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2078211118, now seen corresponding path program 1 times [2022-10-16 12:01:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:16,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717540321] [2022-10-16 12:01:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:16,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:16,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717540321] [2022-10-16 12:01:16,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717540321] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:16,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:16,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:01:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903101777] [2022-10-16 12:01:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:16,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:01:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:01:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:16,473 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-10-16 12:01:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:16,549 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-10-16 12:01:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:01:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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) Word has length 36 [2022-10-16 12:01:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:16,551 INFO L225 Difference]: With dead ends: 96 [2022-10-16 12:01:16,551 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 12:01:16,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:16,552 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:16,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 12:01:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-10-16 12:01:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2625) internal successors, (101), 92 states have internal predecessors, (101), 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-10-16 12:01:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-10-16 12:01:16,560 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 36 [2022-10-16 12:01:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:16,560 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-10-16 12:01:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-10-16 12:01:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-10-16 12:01:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 12:01:16,561 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:16,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:16,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 12:01:16,562 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash 35420, now seen corresponding path program 1 times [2022-10-16 12:01:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:16,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383943943] [2022-10-16 12:01:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:16,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383943943] [2022-10-16 12:01:16,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383943943] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:16,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:16,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:01:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543637962] [2022-10-16 12:01:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:16,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:01:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:01:16,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:16,666 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-10-16 12:01:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:16,755 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-10-16 12:01:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:01:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2022-10-16 12:01:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:16,756 INFO L225 Difference]: With dead ends: 95 [2022-10-16 12:01:16,756 INFO L226 Difference]: Without dead ends: 94 [2022-10-16 12:01:16,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:16,757 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:16,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 183 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-16 12:01:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-10-16 12:01:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 93 states have internal predecessors, (102), 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-10-16 12:01:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-10-16 12:01:16,765 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 37 [2022-10-16 12:01:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:16,766 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-10-16 12:01:16,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-10-16 12:01:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-10-16 12:01:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 12:01:16,767 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:16,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:16,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 12:01:16,767 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:01:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1098224, now seen corresponding path program 1 times [2022-10-16 12:01:16,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:16,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012053794] [2022-10-16 12:01:16,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:01:16,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:01:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:01:16,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:01:16,901 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:01:16,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 32 remaining) [2022-10-16 12:01:16,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 32 remaining) [2022-10-16 12:01:16,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 32 remaining) [2022-10-16 12:01:16,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 32 remaining) [2022-10-16 12:01:16,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 32 remaining) [2022-10-16 12:01:16,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 32 remaining) [2022-10-16 12:01:16,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 32 remaining) [2022-10-16 12:01:16,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 32 remaining) [2022-10-16 12:01:16,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 32 remaining) [2022-10-16 12:01:16,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 32 remaining) [2022-10-16 12:01:16,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 32 remaining) [2022-10-16 12:01:16,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 32 remaining) [2022-10-16 12:01:16,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 32 remaining) [2022-10-16 12:01:16,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 32 remaining) [2022-10-16 12:01:16,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 32 remaining) [2022-10-16 12:01:16,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 32 remaining) [2022-10-16 12:01:16,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 32 remaining) [2022-10-16 12:01:16,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 32 remaining) [2022-10-16 12:01:16,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 32 remaining) [2022-10-16 12:01:16,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 32 remaining) [2022-10-16 12:01:16,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 32 remaining) [2022-10-16 12:01:16,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 32 remaining) [2022-10-16 12:01:16,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 32 remaining) [2022-10-16 12:01:16,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 32 remaining) [2022-10-16 12:01:16,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 32 remaining) [2022-10-16 12:01:16,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 32 remaining) [2022-10-16 12:01:16,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 32 remaining) [2022-10-16 12:01:16,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 32 remaining) [2022-10-16 12:01:16,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 32 remaining) [2022-10-16 12:01:16,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 32 remaining) [2022-10-16 12:01:16,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 32 remaining) [2022-10-16 12:01:16,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 32 remaining) [2022-10-16 12:01:16,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 12:01:16,918 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:16,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:01:16,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:16 BoogieIcfgContainer [2022-10-16 12:01:16,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:01:16,991 INFO L158 Benchmark]: Toolchain (without parser) took 7176.44ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 131.9MB in the beginning and 111.8MB in the end (delta: 20.1MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2022-10-16 12:01:16,991 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 157.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:01:16,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.28ms. Allocated memory is still 157.3MB. Free memory was 131.7MB in the beginning and 118.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 12:01:16,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.42ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 115.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 12:01:16,992 INFO L158 Benchmark]: Boogie Preprocessor took 53.64ms. Allocated memory is still 157.3MB. Free memory was 115.8MB in the beginning and 113.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 12:01:16,993 INFO L158 Benchmark]: RCFGBuilder took 1058.81ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 121.8MB in the end (delta: -8.2MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-10-16 12:01:16,993 INFO L158 Benchmark]: TraceAbstraction took 5468.37ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 121.2MB in the beginning and 111.8MB in the end (delta: 9.4MB). Peak memory consumption was 63.4MB. Max. memory is 8.0GB. [2022-10-16 12:01:16,995 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 157.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.28ms. Allocated memory is still 157.3MB. Free memory was 131.7MB in the beginning and 118.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.42ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 115.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.64ms. Allocated memory is still 157.3MB. Free memory was 115.8MB in the beginning and 113.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1058.81ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 121.8MB in the end (delta: -8.2MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5468.37ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 121.2MB in the beginning and 111.8MB in the end (delta: 9.4MB). Peak memory consumption was 63.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of to_real at line 151, overapproximation of someBinaryArithmeticDOUBLEoperation at line 172, overapproximation of bitwiseAnd at line 61. Possible FailurePath: [L19-L28] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L30] static const double zero = 0.0; [L113-L116] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L118] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L172] double x = 0.0 / 0.0; [L173] CALL __ieee754_log10(x) [L121] double y, z; [L122] __int32_t i, k, hx; [L123] __uint32_t lx; VAL [\old(x)=18014398509482009, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L126] ieee_double_shape_type ew_u; [L127] ew_u.value = (x) [L128] EXPR ew_u.parts.msw [L128] (hx) = ew_u.parts.msw [L129] EXPR ew_u.parts.lsw [L129] (lx) = ew_u.parts.lsw [L132] k = 0 VAL [\old(x)=18014398509482009, hx=3145727, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L133] COND FALSE !(hx < 0x00100000) VAL [\old(x)=18014398509482009, hx=3145727, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L146] COND FALSE !(hx >= 0x7ff00000) VAL [\old(x)=18014398509482009, hx=3145727, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L148] EXPR (hx >> 20) - 1023 VAL [\old(x)=18014398509482009, hx=3145727, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L148] k += (hx >> 20) - 1023 [L149] i = ((__uint32_t)k & 0x80000000) >> 31 VAL [\old(x)=18014398509482009, hx=3145727, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L150] EXPR 0x3ff - i VAL [\old(x)=18014398509482009, hx=3145727, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L150] EXPR (0x3ff - i) << 20 VAL [\old(x)=18014398509482009, hx=3145727, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L150] EXPR 0x3ff - i VAL [\old(x)=18014398509482009, hx=3145727, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L150] EXPR (0x3ff - i) << 20 VAL [\old(x)=18014398509482009, hx=3145727, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L150] hx = (hx & 0x000fffff) | ((0x3ff - i) << 20) VAL [\old(x)=18014398509482009, hx=-1, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L151] EXPR k + i [L151] y = (double)(k + i) VAL [\old(x)=18014398509482009, hx=-1, i=1, ivln10_log10=108573620475812954167/250000000000000000000, k=-1021, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=5, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L153] ieee_double_shape_type sh_u; [L154] sh_u.value = (x) [L155] sh_u.parts.msw = (hx) [L156] EXPR sh_u.value [L156] (x) = sh_u.value [L158] CALL __ieee754_log(x) [L33] double hfsq, f, s, z, R, w, t1, t2, dk; [L34] __int32_t k, hx, i, j; [L35] __uint32_t lx; VAL [\old(x)=18014398509482009, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L38] ieee_double_shape_type ew_u; [L39] ew_u.value = (x) [L40] EXPR ew_u.parts.msw [L40] (hx) = ew_u.parts.msw [L41] EXPR ew_u.parts.lsw [L41] (lx) = ew_u.parts.lsw [L44] k = 0 VAL [\old(x)=18014398509482009, hx=2097151, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=4, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L45] COND FALSE !(hx < 0x00100000) VAL [\old(x)=18014398509482009, hx=2097151, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=4, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L58] COND FALSE !(hx >= 0x7ff00000) VAL [\old(x)=18014398509482009, hx=2097151, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=4, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L60] EXPR (hx >> 20) - 1023 VAL [\old(x)=18014398509482009, hx=2097151, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=4, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L60] k += (hx >> 20) - 1023 [L61] hx &= 0x000fffff VAL [\old(x)=18014398509482009, hx=2146869404, ivln10_log10=108573620475812954167/250000000000000000000, k=-1022, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=4, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] [L62] hx + 0x95f64 VAL [\old(x)=18014398509482009, hx=2146869404, ivln10_log10=108573620475812954167/250000000000000000000, k=-1022, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=4, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509482009, zero=0, zero_log10=0] - UnprovableResult [Line: 138]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 138]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1093 mSDsluCounter, 4020 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2294 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 1726 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 339 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 1028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 12:01:17,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...