/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/float_req_bl_0981.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:03:09,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:03:09,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:03:09,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:03:09,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:03:09,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:03:09,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:03:09,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:03:09,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:03:09,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:03:09,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:03:09,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:03:09,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:03:09,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:03:09,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:03:09,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:03:09,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:03:09,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:03:09,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:03:09,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:03:09,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:03:09,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:03:09,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:03:09,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:03:09,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:03:09,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:03:09,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:03:09,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:03:09,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:03:09,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:03:09,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:03:09,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:03:09,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:03:09,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:03:09,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:03:09,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:03:09,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:03:09,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:03:09,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:03:09,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:03:09,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:03:09,157 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:03:09,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:03:09,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:03:09,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:03:09,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:03:09,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:03:09,219 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:03:09,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:03:09,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:03:09,223 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:03:09,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:03:09,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:03:09,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:03:09,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:03:09,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:03:09,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:03:09,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:03:09,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:03:09,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:03:09,227 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:03:09,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:03:09,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:03:09,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:03:09,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:03:09,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:03:09,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:03:09,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:03:09,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:03:09,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:03:09,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:03:09,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:03:09,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:03:09,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:03:09,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:03:09,232 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:03:09,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:03:09,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:03:09,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:03:09,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:03:09,713 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:03:09,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0981.c [2022-10-16 12:03:09,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b206e1d/717b0493e7cc4cd19e2aae69fb9658b0/FLAG379738aad [2022-10-16 12:03:10,435 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:03:10,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0981.c [2022-10-16 12:03:10,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b206e1d/717b0493e7cc4cd19e2aae69fb9658b0/FLAG379738aad [2022-10-16 12:03:10,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2b206e1d/717b0493e7cc4cd19e2aae69fb9658b0 [2022-10-16 12:03:10,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:03:10,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:03:10,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:03:10,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:03:10,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:03:10,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f45984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10, skipping insertion in model container [2022-10-16 12:03:10,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:03:10,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:03:11,063 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/float_req_bl_0981.c[4209,4222] [2022-10-16 12:03:11,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:03:11,075 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:03:11,152 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/float_req_bl_0981.c[4209,4222] [2022-10-16 12:03:11,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:03:11,190 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:03:11,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11 WrapperNode [2022-10-16 12:03:11,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:03:11,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:03:11,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:03:11,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:03:11,205 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:03:11" (1/1) ... [2022-10-16 12:03:11,235 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:03:11" (1/1) ... [2022-10-16 12:03:11,315 INFO L138 Inliner]: procedures = 17, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2022-10-16 12:03:11,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:03:11,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:03:11,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:03:11,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:03:11,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,413 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:03:11,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:03:11,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:03:11,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:03:11,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (1/1) ... [2022-10-16 12:03:11,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:03:11,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:03:11,462 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:03:11,479 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:03:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:03:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:03:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:03:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:03:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:03:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:03:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:03:11,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:03:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:03:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:03:11,711 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:03:11,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:03:12,388 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:03:12,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:03:12,397 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-16 12:03:12,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:12 BoogieIcfgContainer [2022-10-16 12:03:12,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:03:12,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:03:12,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:03:12,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:03:12,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:03:10" (1/3) ... [2022-10-16 12:03:12,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79aee86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:12, skipping insertion in model container [2022-10-16 12:03:12,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:11" (2/3) ... [2022-10-16 12:03:12,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79aee86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:12, skipping insertion in model container [2022-10-16 12:03:12,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:12" (3/3) ... [2022-10-16 12:03:12,410 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0981.c [2022-10-16 12:03:12,433 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:03:12,433 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-16 12:03:12,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:03:12,510 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;@476a4c74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:03:12,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-16 12:03:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 81 states have (on average 1.8641975308641976) internal successors, (151), 113 states have internal predecessors, (151), 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:03:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 12:03:12,525 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:12,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:12,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1904531819, now seen corresponding path program 1 times [2022-10-16 12:03:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:12,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089358541] [2022-10-16 12:03:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:12,730 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:03:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:12,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089358541] [2022-10-16 12:03:12,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089358541] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:12,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:12,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854861561] [2022-10-16 12:03:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:03:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:03:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:03:12,781 INFO L87 Difference]: Start difference. First operand has 114 states, 81 states have (on average 1.8641975308641976) internal successors, (151), 113 states have internal predecessors, (151), 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 4.5) internal successors, (9), 2 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:03:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:12,821 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-10-16 12:03:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:03:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:03:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:12,840 INFO L225 Difference]: With dead ends: 226 [2022-10-16 12:03:12,841 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 12:03:12,847 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:03:12,853 INFO L413 NwaCegarLoop]: 134 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, 134 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:03:12,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 12:03:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-16 12:03:12,917 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:03:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-10-16 12:03:12,931 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 9 [2022-10-16 12:03:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:12,933 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-10-16 12:03:12,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:03:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-10-16 12:03:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:03:12,934 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:12,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:12,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:03:12,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1483818994, now seen corresponding path program 1 times [2022-10-16 12:03:12,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:12,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102290640] [2022-10-16 12:03:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,111 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:03:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102290640] [2022-10-16 12:03:13,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102290640] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381091548] [2022-10-16 12:03:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,124 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:03:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,204 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-10-16 12:03:13,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:03:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,206 INFO L225 Difference]: With dead ends: 106 [2022-10-16 12:03:13,206 INFO L226 Difference]: Without dead ends: 104 [2022-10-16 12:03:13,209 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:03:13,211 INFO L413 NwaCegarLoop]: 97 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, 183 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.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 183 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-16 12:03:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-10-16 12:03:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.5606060606060606) 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:03:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-10-16 12:03:13,232 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 10 [2022-10-16 12:03:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,232 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-10-16 12:03:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:03:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-10-16 12:03:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:03:13,236 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:03:13,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1483819571, now seen corresponding path program 1 times [2022-10-16 12:03:13,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294478389] [2022-10-16 12:03:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,434 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:03:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294478389] [2022-10-16 12:03:13,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294478389] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963760507] [2022-10-16 12:03:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,438 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:03:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,531 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-10-16 12:03:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:03:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,535 INFO L225 Difference]: With dead ends: 178 [2022-10-16 12:03:13,535 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 12:03:13,536 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:03:13,538 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 87 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 161 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 12:03:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2022-10-16 12:03:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5522388059701493) 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:03:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-10-16 12:03:13,553 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 10 [2022-10-16 12:03:13,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,554 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-10-16 12:03:13,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:03:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-10-16 12:03:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:03:13,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:03:13,557 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:03:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1246233469, now seen corresponding path program 1 times [2022-10-16 12:03:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079702527] [2022-10-16 12:03:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,700 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:03:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079702527] [2022-10-16 12:03:13,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079702527] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357500150] [2022-10-16 12:03:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,705 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:03:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,793 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-10-16 12:03:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:03:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,796 INFO L225 Difference]: With dead ends: 178 [2022-10-16 12:03:13,796 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 12:03:13,797 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:03:13,799 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 82 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 223 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 12:03:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 98. [2022-10-16 12:03:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.5441176470588236) 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:03:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-10-16 12:03:13,812 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 11 [2022-10-16 12:03:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,812 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-10-16 12:03:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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:03:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-10-16 12:03:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:03:13,813 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:03:13,814 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:03:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 21468213, now seen corresponding path program 1 times [2022-10-16 12:03:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752833956] [2022-10-16 12:03:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,996 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:03:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752833956] [2022-10-16 12:03:13,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752833956] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241050631] [2022-10-16 12:03:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:14,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:14,006 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:03:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,074 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-10-16 12:03:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:14,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:03:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,080 INFO L225 Difference]: With dead ends: 102 [2022-10-16 12:03:14,081 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 12:03:14,082 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:03:14,083 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 180 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 12:03:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-10-16 12:03:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.536231884057971) 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:03:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-16 12:03:14,108 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 12 [2022-10-16 12:03:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,112 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-16 12:03:14,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:03:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-16 12:03:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 12:03:14,114 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:14,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:03:14,115 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:03:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 665514693, now seen corresponding path program 1 times [2022-10-16 12:03:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477535925] [2022-10-16 12:03:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,280 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:03:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477535925] [2022-10-16 12:03:14,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477535925] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801840980] [2022-10-16 12:03:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:14,290 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:03:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,354 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-10-16 12:03:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:14,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:03:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,357 INFO L225 Difference]: With dead ends: 101 [2022-10-16 12:03:14,357 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 12:03:14,357 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:03:14,359 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 180 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 12:03:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-16 12:03:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.5285714285714285) 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:03:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-10-16 12:03:14,367 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 13 [2022-10-16 12:03:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,368 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-10-16 12:03:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:03:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-10-16 12:03:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:03:14,369 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:03:14,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1377335361, now seen corresponding path program 1 times [2022-10-16 12:03:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985679470] [2022-10-16 12:03:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,535 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:03:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985679470] [2022-10-16 12:03:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985679470] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773501000] [2022-10-16 12:03:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:14,543 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,596 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-10-16 12:03:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:14,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 12:03:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,599 INFO L225 Difference]: With dead ends: 155 [2022-10-16 12:03:14,599 INFO L226 Difference]: Without dead ends: 154 [2022-10-16 12:03:14,600 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:03:14,601 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 93 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 138 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-16 12:03:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2022-10-16 12:03:14,608 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:03:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-16 12:03:14,609 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 14 [2022-10-16 12:03:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,610 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-16 12:03:14,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-16 12:03:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:03:14,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:03:14,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:14,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -843880905, now seen corresponding path program 1 times [2022-10-16 12:03:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339794630] [2022-10-16 12:03:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,807 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:03:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339794630] [2022-10-16 12:03:14,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339794630] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206479101] [2022-10-16 12:03:14,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:14,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:14,816 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,858 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-10-16 12:03:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 12:03:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,860 INFO L225 Difference]: With dead ends: 99 [2022-10-16 12:03:14,860 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 12:03:14,861 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:03:14,865 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:03:14,870 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:03:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 12:03:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-10-16 12:03:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.457142857142857) 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:03:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-10-16 12:03:14,891 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 14 [2022-10-16 12:03:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,892 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-10-16 12:03:14,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-10-16 12:03:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:03:14,898 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:14,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:03:14,899 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:03:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash 252276855, now seen corresponding path program 1 times [2022-10-16 12:03:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384847484] [2022-10-16 12:03:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,044 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:03:15,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384847484] [2022-10-16 12:03:15,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384847484] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035315301] [2022-10-16 12:03:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:15,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,050 INFO L87 Difference]: Start difference. First operand 95 states and 102 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:03:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,098 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-10-16 12:03:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:15,098 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:03:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,100 INFO L225 Difference]: With dead ends: 150 [2022-10-16 12:03:15,100 INFO L226 Difference]: Without dead ends: 149 [2022-10-16 12:03:15,101 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:03:15,105 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 87 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 134 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-10-16 12:03:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 94. [2022-10-16 12:03:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 93 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:03:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-10-16 12:03:15,130 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 15 [2022-10-16 12:03:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,132 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-10-16 12:03:15,132 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:03:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-10-16 12:03:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:03:15,134 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:03:15,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -390504185, now seen corresponding path program 1 times [2022-10-16 12:03:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33984607] [2022-10-16 12:03:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,349 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:03:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33984607] [2022-10-16 12:03:15,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33984607] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681231557] [2022-10-16 12:03:15,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:15,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,352 INFO L87 Difference]: Start difference. First operand 94 states and 101 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:03:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,387 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-10-16 12:03:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:15,388 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:03:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,389 INFO L225 Difference]: With dead ends: 149 [2022-10-16 12:03:15,389 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 12:03:15,390 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:03:15,391 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 69 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 91 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:03:15,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 12:03:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-10-16 12:03:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3428571428571427) 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:03:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-10-16 12:03:15,397 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 15 [2022-10-16 12:03:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,397 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-10-16 12:03:15,397 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:03:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-10-16 12:03:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:03:15,398 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,398 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:03:15,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:03:15,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -769351999, now seen corresponding path program 1 times [2022-10-16 12:03:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988710551] [2022-10-16 12:03:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,514 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:03:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988710551] [2022-10-16 12:03:15,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988710551] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:03:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812710757] [2022-10-16 12:03:15,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:03:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:03:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:03:15,517 INFO L87 Difference]: Start difference. First operand 90 states and 94 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:03:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,608 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-10-16 12:03:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:03:15,609 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:03:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,610 INFO L225 Difference]: With dead ends: 90 [2022-10-16 12:03:15,610 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 12:03:15,611 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:03:15,611 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 285 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:03:15,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 285 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 12:03:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-16 12:03:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 88 states have internal predecessors, (93), 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:03:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-10-16 12:03:15,634 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 16 [2022-10-16 12:03:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,635 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-10-16 12:03:15,635 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:03:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-10-16 12:03:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:03:15,636 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,636 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:03:15,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:03:15,637 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1919891897, now seen corresponding path program 1 times [2022-10-16 12:03:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833799842] [2022-10-16 12:03:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,750 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:03:15,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833799842] [2022-10-16 12:03:15,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833799842] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:03:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235463769] [2022-10-16 12:03:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:03:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:03:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:03:15,754 INFO L87 Difference]: Start difference. First operand 89 states and 93 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:03:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,820 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-10-16 12:03:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:03:15,821 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:03:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,822 INFO L225 Difference]: With dead ends: 89 [2022-10-16 12:03:15,822 INFO L226 Difference]: Without dead ends: 88 [2022-10-16 12:03:15,822 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:03:15,823 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 281 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-10-16 12:03:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2022-10-16 12:03:15,828 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:03:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-10-16 12:03:15,828 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 17 [2022-10-16 12:03:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,829 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-10-16 12:03:15,829 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:03:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-10-16 12:03:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 12:03:15,830 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,830 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] [2022-10-16 12:03:15,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 12:03:15,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash 3907146, now seen corresponding path program 1 times [2022-10-16 12:03:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992140428] [2022-10-16 12:03:15,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,971 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:03:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992140428] [2022-10-16 12:03:15,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992140428] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:03:15,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53645409] [2022-10-16 12:03:15,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:03:15,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:03:15,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:03:15,974 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:16,105 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2022-10-16 12:03:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:03:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 12:03:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:16,108 INFO L225 Difference]: With dead ends: 155 [2022-10-16 12:03:16,108 INFO L226 Difference]: Without dead ends: 154 [2022-10-16 12:03:16,109 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:03:16,109 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 145 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:16,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 306 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-16 12:03:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 101. [2022-10-16 12:03:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 100 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:03:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-10-16 12:03:16,117 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 26 [2022-10-16 12:03:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:16,117 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-10-16 12:03:16,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-10-16 12:03:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 12:03:16,119 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:16,119 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] [2022-10-16 12:03:16,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 12:03:16,119 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 121121657, now seen corresponding path program 1 times [2022-10-16 12:03:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:16,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064189828] [2022-10-16 12:03:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:16,250 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:03:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:16,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064189828] [2022-10-16 12:03:16,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064189828] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:16,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:16,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:03:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515232161] [2022-10-16 12:03:16,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:16,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:03:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:03:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:03:16,253 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:03:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:16,348 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2022-10-16 12:03:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:03:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2022-10-16 12:03:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:16,350 INFO L225 Difference]: With dead ends: 154 [2022-10-16 12:03:16,351 INFO L226 Difference]: Without dead ends: 153 [2022-10-16 12:03:16,351 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:03:16,352 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 137 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:16,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 259 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-16 12:03:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2022-10-16 12:03:16,358 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:03:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-10-16 12:03:16,359 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 27 [2022-10-16 12:03:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:16,359 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-10-16 12:03:16,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:03:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-10-16 12:03:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 12:03:16,360 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:16,361 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:03:16,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 12:03:16,361 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1081951190, now seen corresponding path program 1 times [2022-10-16 12:03:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122378447] [2022-10-16 12:03:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:16,558 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:03:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:16,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122378447] [2022-10-16 12:03:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122378447] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:16,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:16,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:03:16,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978857914] [2022-10-16 12:03:16,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:16,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:03:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:16,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:03:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:16,561 INFO L87 Difference]: Start difference. First operand 102 states and 107 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:03:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:16,701 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-10-16 12:03:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:03:16,702 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:03:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:16,703 INFO L225 Difference]: With dead ends: 102 [2022-10-16 12:03:16,703 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 12:03:16,704 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:03:16,704 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 147 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:16,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 242 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 12:03:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-10-16 12:03:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 100 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:03:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-10-16 12:03:16,711 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 30 [2022-10-16 12:03:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-10-16 12:03:16,712 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:03:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-10-16 12:03:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 12:03:16,713 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:16,713 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:03:16,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 12:03:16,714 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -819251347, now seen corresponding path program 1 times [2022-10-16 12:03:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:16,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116750214] [2022-10-16 12:03:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:16,983 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:03:16,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:16,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116750214] [2022-10-16 12:03:16,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116750214] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:16,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:16,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:03:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024212026] [2022-10-16 12:03:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:16,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:03:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:03:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:16,986 INFO L87 Difference]: Start difference. First operand 101 states and 106 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:03:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:17,095 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-10-16 12:03:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:03:17,096 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:03:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:17,097 INFO L225 Difference]: With dead ends: 101 [2022-10-16 12:03:17,097 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 12:03:17,098 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:03:17,099 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 159 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:17,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 181 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 12:03:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-10-16 12:03:17,105 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:03:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-10-16 12:03:17,106 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 31 [2022-10-16 12:03:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:17,107 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-10-16 12:03:17,107 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:03:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-10-16 12:03:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 12:03:17,108 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:17,108 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:03:17,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 12:03:17,108 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:03:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1518509379, now seen corresponding path program 1 times [2022-10-16 12:03:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387822555] [2022-10-16 12:03:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:17,196 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:03:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:17,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387822555] [2022-10-16 12:03:17,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387822555] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:17,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:17,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283675982] [2022-10-16 12:03:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:17,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:17,200 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:03:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:17,228 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-10-16 12:03:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-10-16 12:03:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:17,229 INFO L225 Difference]: With dead ends: 90 [2022-10-16 12:03:17,229 INFO L226 Difference]: Without dead ends: 88 [2022-10-16 12:03:17,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:17,233 INFO L413 NwaCegarLoop]: 78 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, 145 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:03:17,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 145 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-10-16 12:03:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-10-16 12:03:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 79 states have internal predecessors, (84), 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:03:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-10-16 12:03:17,242 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 38 [2022-10-16 12:03:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:17,243 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-10-16 12:03:17,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:03:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-10-16 12:03:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 12:03:17,244 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:17,244 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:03:17,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 12:03:17,244 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1518509956, now seen corresponding path program 1 times [2022-10-16 12:03:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:17,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617443115] [2022-10-16 12:03:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:17,349 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:03:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:17,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617443115] [2022-10-16 12:03:17,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617443115] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:17,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:17,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195672657] [2022-10-16 12:03:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:17,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:17,351 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:03:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:17,421 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-10-16 12:03:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-10-16 12:03:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:17,422 INFO L225 Difference]: With dead ends: 103 [2022-10-16 12:03:17,423 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 12:03:17,423 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:03:17,424 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:17,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 110 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 12:03:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-10-16 12:03:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2857142857142858) 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:03:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-10-16 12:03:17,433 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 38 [2022-10-16 12:03:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:17,434 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-10-16 12:03:17,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:03:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-10-16 12:03:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 12:03:17,437 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:17,437 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, 1] [2022-10-16 12:03:17,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 12:03:17,438 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:17,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash -170831422, now seen corresponding path program 1 times [2022-10-16 12:03:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:17,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583047303] [2022-10-16 12:03:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:17,603 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:03:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:17,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583047303] [2022-10-16 12:03:17,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583047303] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:17,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:17,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559102206] [2022-10-16 12:03:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:17,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:17,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:17,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:17,607 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:17,659 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-10-16 12:03:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-16 12:03:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:17,660 INFO L225 Difference]: With dead ends: 97 [2022-10-16 12:03:17,661 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 12:03:17,661 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:03:17,662 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:17,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 12:03:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-10-16 12:03:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.2820512820512822) 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:03:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-10-16 12:03:17,670 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 39 [2022-10-16 12:03:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:17,670 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-10-16 12:03:17,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-10-16 12:03:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 12:03:17,671 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:17,671 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, 1, 1] [2022-10-16 12:03:17,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 12:03:17,672 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1000806586, now seen corresponding path program 1 times [2022-10-16 12:03:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:17,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376438320] [2022-10-16 12:03:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:17,792 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:03:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376438320] [2022-10-16 12:03:17,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376438320] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:17,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:17,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436752607] [2022-10-16 12:03:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:17,797 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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:03:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:17,892 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-10-16 12:03:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:17,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-10-16 12:03:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:17,893 INFO L225 Difference]: With dead ends: 96 [2022-10-16 12:03:17,893 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 12:03:17,893 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:03:17,894 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:17,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 182 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 12:03:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-10-16 12:03:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2784810126582278) 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:03:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-10-16 12:03:17,902 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 40 [2022-10-16 12:03:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:17,902 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-10-16 12:03:17,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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:03:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-10-16 12:03:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 12:03:17,903 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:17,903 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, 1, 1, 1] [2022-10-16 12:03:17,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 12:03:17,904 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:17,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:17,904 INFO L85 PathProgramCache]: Analyzing trace with hash -960232892, now seen corresponding path program 1 times [2022-10-16 12:03:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:17,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984638519] [2022-10-16 12:03:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:18,018 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:03:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984638519] [2022-10-16 12:03:18,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984638519] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:18,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:18,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488062618] [2022-10-16 12:03:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:18,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:18,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:18,021 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:03:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:18,100 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-10-16 12:03:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2022-10-16 12:03:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:18,102 INFO L225 Difference]: With dead ends: 95 [2022-10-16 12:03:18,102 INFO L226 Difference]: Without dead ends: 94 [2022-10-16 12:03:18,102 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:03:18,103 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:18,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-16 12:03:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-10-16 12:03:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.275) 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:03:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-10-16 12:03:18,111 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 41 [2022-10-16 12:03:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:18,111 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-10-16 12:03:18,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:03:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-10-16 12:03:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 12:03:18,112 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:18,113 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, 1, 1, 1, 1] [2022-10-16 12:03:18,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 12:03:18,113 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -235902832, now seen corresponding path program 1 times [2022-10-16 12:03:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:18,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178387426] [2022-10-16 12:03:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:18,244 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:03:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:18,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178387426] [2022-10-16 12:03:18,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178387426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:18,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:18,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289624781] [2022-10-16 12:03:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:18,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:18,247 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:18,293 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-10-16 12:03:18,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-10-16 12:03:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:18,294 INFO L225 Difference]: With dead ends: 94 [2022-10-16 12:03:18,294 INFO L226 Difference]: Without dead ends: 93 [2022-10-16 12:03:18,295 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:03:18,295 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:18,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 87 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-16 12:03:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-10-16 12:03:18,302 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:03:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-10-16 12:03:18,303 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 42 [2022-10-16 12:03:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:18,303 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-10-16 12:03:18,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-10-16 12:03:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 12:03:18,304 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:18,304 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, 1, 1, 1, 1] [2022-10-16 12:03:18,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 12:03:18,305 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash 297551624, now seen corresponding path program 1 times [2022-10-16 12:03:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:18,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109230397] [2022-10-16 12:03:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:03:18,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:03:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:03:18,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:03:18,432 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:03:18,435 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 32 remaining) [2022-10-16 12:03:18,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 32 remaining) [2022-10-16 12:03:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 32 remaining) [2022-10-16 12:03:18,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 32 remaining) [2022-10-16 12:03:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 32 remaining) [2022-10-16 12:03:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 32 remaining) [2022-10-16 12:03:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 32 remaining) [2022-10-16 12:03:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 32 remaining) [2022-10-16 12:03:18,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 32 remaining) [2022-10-16 12:03:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 32 remaining) [2022-10-16 12:03:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 32 remaining) [2022-10-16 12:03:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 32 remaining) [2022-10-16 12:03:18,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 32 remaining) [2022-10-16 12:03:18,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 32 remaining) [2022-10-16 12:03:18,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 32 remaining) [2022-10-16 12:03:18,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 32 remaining) [2022-10-16 12:03:18,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 32 remaining) [2022-10-16 12:03:18,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 32 remaining) [2022-10-16 12:03:18,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 32 remaining) [2022-10-16 12:03:18,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 32 remaining) [2022-10-16 12:03:18,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 32 remaining) [2022-10-16 12:03:18,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 32 remaining) [2022-10-16 12:03:18,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 32 remaining) [2022-10-16 12:03:18,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 32 remaining) [2022-10-16 12:03:18,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 32 remaining) [2022-10-16 12:03:18,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 32 remaining) [2022-10-16 12:03:18,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 32 remaining) [2022-10-16 12:03:18,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 32 remaining) [2022-10-16 12:03:18,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 32 remaining) [2022-10-16 12:03:18,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 32 remaining) [2022-10-16 12:03:18,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 32 remaining) [2022-10-16 12:03:18,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 32 remaining) [2022-10-16 12:03:18,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 12:03:18,455 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, 1, 1] [2022-10-16 12:03:18,460 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:03:18,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:03:18 BoogieIcfgContainer [2022-10-16 12:03:18,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:03:18,573 INFO L158 Benchmark]: Toolchain (without parser) took 7759.91ms. Allocated memory was 166.7MB in the beginning and 225.4MB in the end (delta: 58.7MB). Free memory was 141.2MB in the beginning and 120.9MB in the end (delta: 20.3MB). Peak memory consumption was 80.5MB. Max. memory is 8.0GB. [2022-10-16 12:03:18,574 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 166.7MB. Free memory was 137.7MB in the beginning and 137.6MB in the end (delta: 77.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:03:18,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.72ms. Allocated memory is still 166.7MB. Free memory was 140.9MB in the beginning and 128.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 12:03:18,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.72ms. Allocated memory is still 166.7MB. Free memory was 128.2MB in the beginning and 125.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 12:03:18,579 INFO L158 Benchmark]: Boogie Preprocessor took 103.65ms. Allocated memory is still 166.7MB. Free memory was 125.3MB in the beginning and 123.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 12:03:18,580 INFO L158 Benchmark]: RCFGBuilder took 977.61ms. Allocated memory is still 166.7MB. Free memory was 123.0MB in the beginning and 130.4MB in the end (delta: -7.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-10-16 12:03:18,580 INFO L158 Benchmark]: TraceAbstraction took 6169.69ms. Allocated memory was 166.7MB in the beginning and 225.4MB in the end (delta: 58.7MB). Free memory was 129.3MB in the beginning and 120.9MB in the end (delta: 8.4MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2022-10-16 12:03:18,582 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.26ms. Allocated memory is still 166.7MB. Free memory was 137.7MB in the beginning and 137.6MB in the end (delta: 77.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.72ms. Allocated memory is still 166.7MB. Free memory was 140.9MB in the beginning and 128.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 123.72ms. Allocated memory is still 166.7MB. Free memory was 128.2MB in the beginning and 125.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.65ms. Allocated memory is still 166.7MB. Free memory was 125.3MB in the beginning and 123.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 977.61ms. Allocated memory is still 166.7MB. Free memory was 123.0MB in the beginning and 130.4MB in the end (delta: -7.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * TraceAbstraction took 6169.69ms. Allocated memory was 166.7MB in the beginning and 225.4MB in the end (delta: 58.7MB). Free memory was 129.3MB in the beginning and 120.9MB in the end (delta: 8.4MB). Peak memory consumption was 68.7MB. 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: 49]: 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 135, overapproximation of someBinaryArithmeticFLOAToperation at line 165, overapproximation of bitwiseAnd at line 48. Possible FailurePath: [L13-L17] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L19] static const float zero_log = 0.0; [L99-L102] static const float two25_log10 = 3.3554432000e+07, ivln10_log10 = 4.3429449201e-01, log10_2hi_log10 = 3.0102920532e-01, log10_2lo_log10 = 7.9034151668e-07; [L104] static const float zero = 0.0; VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, zero=0, zero_log=0] [L165] float x = 1.0f / 0.0f; [L166] CALL __ieee754_log10f(x) [L107] float y, z; [L108] __int32_t i, k, hx; VAL [\old(x)=4320133137, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L111] ieee_float_shape_type gf_u; [L112] gf_u.value = (x) [L113] EXPR gf_u.word [L113] (hx) = gf_u.word [L116] k = 0 VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L117] COND FALSE !(((hx & 0x7fffffff) == 0)) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L119] COND FALSE !(hx < 0) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L121] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L123] COND FALSE !(((hx) < 0x00800000L)) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L132] EXPR (hx >> 23) - 127 VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L132] k += (hx >> 23) - 127 [L133] i = ((__uint32_t)k & 0x80000000) >> 31 VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L134] EXPR 0x7f - i VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L134] EXPR (0x7f - i) << 23 VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L134] EXPR 0x7f - i VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L134] EXPR (0x7f - i) << 23 VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L134] hx = (hx & 0x007fffff) | ((0x7f - i) << 23) VAL [\old(x)=4320133137, hx=0, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L135] EXPR k + i [L135] y = (float)(k + i) VAL [\old(x)=4320133137, hx=0, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L137] ieee_float_shape_type sf_u; [L138] sf_u.word = (hx) [L139] EXPR sf_u.value [L139] (x) = sf_u.value [L141] CALL __ieee754_logf(x) [L22] float hfsq, f, s, z, R, w, t1, t2, dk; [L23] __int32_t k, ix, i, j; VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (ix) = gf_u.word [L31] k = 0 VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L32] COND FALSE !(((ix & 0x7fffffff) == 0)) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L34] COND FALSE !(ix < 0) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L36] COND FALSE !(!((ix) < 0x7f800000L)) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L38] COND FALSE !(((ix) < 0x00800000L)) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L47] EXPR (ix >> 23) - 127 VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L47] k += (ix >> 23) - 127 [L48] ix &= 0x007fffff VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=2142569696, k=-126, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L49] ix + (0x95f64 << 3) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=2142569696, k=-126, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: 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, 114 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1238 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1238 mSDsluCounter, 3902 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2110 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 943 IncrementalHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1792 mSDtfsCounter, 943 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=0, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 426 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 1142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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:03:18,661 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...