./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6ba0756961e47bc02202fdbcd11be999219b225857cf3037504c91aadb636cb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:57:45,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:57:45,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:57:45,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:57:45,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:57:45,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:57:45,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:57:45,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:57:45,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:57:45,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:57:45,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:57:45,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:57:45,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:57:45,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:57:45,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:57:45,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:57:45,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:57:45,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:57:45,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:57:45,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:57:45,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:57:45,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:57:45,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:57:45,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:57:45,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:57:45,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:57:45,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:57:45,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:57:45,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:57:45,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:57:45,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:57:45,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:57:45,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:57:45,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:57:45,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:57:45,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:57:45,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:57:45,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:57:45,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:57:45,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:57:45,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:57:45,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 20:57:45,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:57:45,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:57:45,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:57:45,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:57:45,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:57:45,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:57:45,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:57:45,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:57:45,931 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:57:45,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:57:45,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:57:45,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:57:45,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:57:45,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:57:45,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:57:45,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:57:45,934 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:57:45,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:57:45,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:57:45,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:57:45,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:57:45,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:57:45,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:57:45,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:57:45,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:57:45,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:57:45,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:57:45,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:57:45,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:57:45,938 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:57:45,938 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:57:45,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:57:45,939 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6ba0756961e47bc02202fdbcd11be999219b225857cf3037504c91aadb636cb [2022-11-18 20:57:46,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:57:46,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:57:46,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:57:46,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:57:46,333 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:57:46,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_good.i [2022-11-18 20:57:46,441 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/data/b50e33ae0/a0e2ec40684646e3ab521038a9c49ec1/FLAG452201de7 [2022-11-18 20:57:47,139 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:57:47,140 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_15_good.i [2022-11-18 20:57:47,174 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/data/b50e33ae0/a0e2ec40684646e3ab521038a9c49ec1/FLAG452201de7 [2022-11-18 20:57:47,352 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/data/b50e33ae0/a0e2ec40684646e3ab521038a9c49ec1 [2022-11-18 20:57:47,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:57:47,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:57:47,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:57:47,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:57:47,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:57:47,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:57:47" (1/1) ... [2022-11-18 20:57:47,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b15da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:47, skipping insertion in model container [2022-11-18 20:57:47,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:57:47" (1/1) ... [2022-11-18 20:57:47,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:57:47,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:57:47,962 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-18 20:57:48,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:57:48,541 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:57:48,560 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-18 20:57:48,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:57:48,774 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:57:48,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48 WrapperNode [2022-11-18 20:57:48,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:57:48,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:57:48,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:57:48,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:57:48,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,841 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 187 [2022-11-18 20:57:48,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:57:48,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:57:48,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:57:48,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:57:48,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:57:48,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:57:48,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:57:48,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:57:48,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (1/1) ... [2022-11-18 20:57:48,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:57:48,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:57:48,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:57:48,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:57:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-18 20:57:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-18 20:57:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-18 20:57:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-18 20:57:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-18 20:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-18 20:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:57:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:57:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:57:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-18 20:57:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:57:49,172 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:57:49,174 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:57:49,579 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:57:49,586 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:57:49,586 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:57:49,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:49 BoogieIcfgContainer [2022-11-18 20:57:49,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:57:49,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:57:49,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:57:49,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:57:49,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:57:47" (1/3) ... [2022-11-18 20:57:49,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec8210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:57:49, skipping insertion in model container [2022-11-18 20:57:49,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:48" (2/3) ... [2022-11-18 20:57:49,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ec8210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:57:49, skipping insertion in model container [2022-11-18 20:57:49,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:49" (3/3) ... [2022-11-18 20:57:49,598 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_15_good.i [2022-11-18 20:57:49,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:57:49,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-18 20:57:49,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:57:49,700 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=PETRI_NET, 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;@29c6e7d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:57:49,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-18 20:57:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-18 20:57:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:57:49,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:49,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:49,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313757, now seen corresponding path program 1 times [2022-11-18 20:57:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:49,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382716196] [2022-11-18 20:57:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382716196] [2022-11-18 20:57:50,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382716196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:50,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:50,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515938326] [2022-11-18 20:57:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:50,109 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:50,156 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2022-11-18 20:57:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-18 20:57:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:50,169 INFO L225 Difference]: With dead ends: 156 [2022-11-18 20:57:50,169 INFO L226 Difference]: Without dead ends: 70 [2022-11-18 20:57:50,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-18 20:57:50,177 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:50,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-18 20:57:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-18 20:57:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 20:57:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-11-18 20:57:50,229 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 15 [2022-11-18 20:57:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:50,230 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-11-18 20:57:50,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-11-18 20:57:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:57:50,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:50,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:50,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:57:50,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1328587979, now seen corresponding path program 1 times [2022-11-18 20:57:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000286705] [2022-11-18 20:57:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:50,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:50,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000286705] [2022-11-18 20:57:50,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000286705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:50,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:50,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:57:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155627959] [2022-11-18 20:57:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:50,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:50,416 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:50,435 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-11-18 20:57:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:50,436 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-18 20:57:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:50,437 INFO L225 Difference]: With dead ends: 70 [2022-11-18 20:57:50,438 INFO L226 Difference]: Without dead ends: 69 [2022-11-18 20:57:50,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:50,440 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:50,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-18 20:57:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-18 20:57:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5) internal successors, (69), 65 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 20:57:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2022-11-18 20:57:50,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 16 [2022-11-18 20:57:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:50,452 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2022-11-18 20:57:50,452 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2022-11-18 20:57:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:57:50,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:50,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:57:50,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1763445692, now seen corresponding path program 1 times [2022-11-18 20:57:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557852771] [2022-11-18 20:57:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:50,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557852771] [2022-11-18 20:57:50,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557852771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:50,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:50,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143888487] [2022-11-18 20:57:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:50,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:57:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:57:50,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:57:50,700 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:50,770 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2022-11-18 20:57:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:57:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-18 20:57:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:50,775 INFO L225 Difference]: With dead ends: 69 [2022-11-18 20:57:50,778 INFO L226 Difference]: Without dead ends: 68 [2022-11-18 20:57:50,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:57:50,781 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:50,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-18 20:57:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-18 20:57:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 64 states have internal predecessors, (68), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 20:57:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-11-18 20:57:50,808 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 17 [2022-11-18 20:57:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:50,809 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-11-18 20:57:50,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2022-11-18 20:57:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:57:50,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:50,813 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] [2022-11-18 20:57:50,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:57:50,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 799401358, now seen corresponding path program 1 times [2022-11-18 20:57:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:50,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213414420] [2022-11-18 20:57:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:50,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:50,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213414420] [2022-11-18 20:57:50,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213414420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:50,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:50,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789292039] [2022-11-18 20:57:50,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:50,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:50,934 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:50,970 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2022-11-18 20:57:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-18 20:57:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:50,981 INFO L225 Difference]: With dead ends: 119 [2022-11-18 20:57:50,984 INFO L226 Difference]: Without dead ends: 68 [2022-11-18 20:57:50,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-18 20:57:50,987 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:50,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-18 20:57:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-18 20:57:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 63 states have internal predecessors, (67), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 20:57:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-11-18 20:57:51,007 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 22 [2022-11-18 20:57:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:51,008 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-11-18 20:57:51,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:57:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2022-11-18 20:57:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:57:51,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:51,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:51,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:57:51,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash 510911504, now seen corresponding path program 1 times [2022-11-18 20:57:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:51,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867141119] [2022-11-18 20:57:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:57:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:57:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867141119] [2022-11-18 20:57:51,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867141119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:51,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:51,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014282413] [2022-11-18 20:57:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:51,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:51,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:51,076 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:57:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:51,095 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2022-11-18 20:57:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:51,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-11-18 20:57:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:51,097 INFO L225 Difference]: With dead ends: 119 [2022-11-18 20:57:51,098 INFO L226 Difference]: Without dead ends: 67 [2022-11-18 20:57:51,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-18 20:57:51,100 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:51,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:51,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-18 20:57:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-18 20:57:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-18 20:57:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2022-11-18 20:57:51,111 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 26 [2022-11-18 20:57:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:51,112 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2022-11-18 20:57:51,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:57:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-11-18 20:57:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 20:57:51,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:51,114 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:51,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:57:51,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash 612038571, now seen corresponding path program 1 times [2022-11-18 20:57:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:51,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419855766] [2022-11-18 20:57:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:57:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:51,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419855766] [2022-11-18 20:57:51,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419855766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:51,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405927518] [2022-11-18 20:57:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:51,174 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:51,190 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-11-18 20:57:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-18 20:57:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:51,192 INFO L225 Difference]: With dead ends: 110 [2022-11-18 20:57:51,192 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:57:51,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-18 20:57:51,194 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:51,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:57:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:57:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-18 20:57:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-11-18 20:57:51,205 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 28 [2022-11-18 20:57:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:51,205 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-11-18 20:57:51,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-11-18 20:57:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:57:51,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:51,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:51,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:57:51,208 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1126717929, now seen corresponding path program 1 times [2022-11-18 20:57:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:51,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500935217] [2022-11-18 20:57:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:57:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:51,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500935217] [2022-11-18 20:57:51,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500935217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:51,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:51,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:57:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103686473] [2022-11-18 20:57:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:51,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:51,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:51,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:51,455 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:51,480 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-11-18 20:57:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-18 20:57:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:51,485 INFO L225 Difference]: With dead ends: 65 [2022-11-18 20:57:51,485 INFO L226 Difference]: Without dead ends: 64 [2022-11-18 20:57:51,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-18 20:57:51,489 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:51,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-18 20:57:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-18 20:57:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 59 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-18 20:57:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-11-18 20:57:51,527 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 29 [2022-11-18 20:57:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:51,530 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-18 20:57:51,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-11-18 20:57:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:57:51,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:51,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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-11-18 20:57:51,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:57:51,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 568517554, now seen corresponding path program 1 times [2022-11-18 20:57:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:51,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776284636] [2022-11-18 20:57:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:57:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:51,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776284636] [2022-11-18 20:57:51,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776284636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:51,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:51,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177558100] [2022-11-18 20:57:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:51,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:57:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:57:51,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:57:51,732 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:51,781 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-11-18 20:57:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:57:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-18 20:57:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:51,783 INFO L225 Difference]: With dead ends: 64 [2022-11-18 20:57:51,783 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 20:57:51,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:57:51,785 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:51,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 198 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 20:57:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-18 20:57:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 58 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-18 20:57:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-11-18 20:57:51,802 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 30 [2022-11-18 20:57:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:51,803 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-11-18 20:57:51,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-11-18 20:57:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 20:57:51,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:51,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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-11-18 20:57:51,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:57:51,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash -243306749, now seen corresponding path program 1 times [2022-11-18 20:57:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:51,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076855056] [2022-11-18 20:57:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:57:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:51,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076855056] [2022-11-18 20:57:51,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076855056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:51,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:51,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834035430] [2022-11-18 20:57:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:51,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:51,891 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:51,908 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-11-18 20:57:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-18 20:57:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:51,911 INFO L225 Difference]: With dead ends: 95 [2022-11-18 20:57:51,911 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 20:57:51,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-18 20:57:51,919 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:51,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 20:57:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-18 20:57:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:57:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-11-18 20:57:51,949 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 35 [2022-11-18 20:57:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:51,949 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-11-18 20:57:51,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:57:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-11-18 20:57:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:57:51,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:51,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-11-18 20:57:51,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:57:51,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1207061858, now seen corresponding path program 1 times [2022-11-18 20:57:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:51,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200521120] [2022-11-18 20:57:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:57:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:57:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200521120] [2022-11-18 20:57:52,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200521120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:52,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:52,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192948657] [2022-11-18 20:57:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:52,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:57:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:52,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:57:52,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:57:52,083 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:52,126 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2022-11-18 20:57:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:57:52,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-18 20:57:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:52,130 INFO L225 Difference]: With dead ends: 80 [2022-11-18 20:57:52,130 INFO L226 Difference]: Without dead ends: 78 [2022-11-18 20:57:52,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:57:52,131 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:52,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-18 20:57:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2022-11-18 20:57:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3125) internal successors, (63), 59 states have internal predecessors, (63), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:57:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-11-18 20:57:52,166 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 40 [2022-11-18 20:57:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:52,167 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-11-18 20:57:52,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-11-18 20:57:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:57:52,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:52,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-11-18 20:57:52,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:57:52,173 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1207002276, now seen corresponding path program 1 times [2022-11-18 20:57:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:52,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549806404] [2022-11-18 20:57:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:57:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:57:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:52,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549806404] [2022-11-18 20:57:52,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549806404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:52,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:52,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986815848] [2022-11-18 20:57:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:52,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:52,264 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:52,277 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2022-11-18 20:57:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:52,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-18 20:57:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:52,279 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:57:52,280 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:57:52,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11-18 20:57:52,281 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:52,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:57:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 20:57:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-18 20:57:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-11-18 20:57:52,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 40 [2022-11-18 20:57:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:52,290 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-18 20:57:52,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-11-18 20:57:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:57:52,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:52,291 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-11-18 20:57:52,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:57:52,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash 210930585, now seen corresponding path program 1 times [2022-11-18 20:57:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:52,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809769121] [2022-11-18 20:57:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:57:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-18 20:57:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 20:57:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809769121] [2022-11-18 20:57:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809769121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:52,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:52,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271885924] [2022-11-18 20:57:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:52,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:52,391 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:57:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:52,409 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-11-18 20:57:52,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-11-18 20:57:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:52,411 INFO L225 Difference]: With dead ends: 86 [2022-11-18 20:57:52,411 INFO L226 Difference]: Without dead ends: 58 [2022-11-18 20:57:52,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-18 20:57:52,414 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:52,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-18 20:57:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-18 20:57:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 52 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-18 20:57:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-11-18 20:57:52,428 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 44 [2022-11-18 20:57:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:52,429 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-11-18 20:57:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:57:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-11-18 20:57:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:57:52,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:52,431 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-11-18 20:57:52,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:57:52,432 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1068830320, now seen corresponding path program 1 times [2022-11-18 20:57:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705859584] [2022-11-18 20:57:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:57:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:57:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:52,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705859584] [2022-11-18 20:57:52,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705859584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:52,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:52,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601319274] [2022-11-18 20:57:52,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:52,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:52,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:52,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:52,523 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:52,549 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-11-18 20:57:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-18 20:57:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:52,552 INFO L225 Difference]: With dead ends: 73 [2022-11-18 20:57:52,552 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:57:52,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11-18 20:57:52,555 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:52,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:57:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-18 20:57:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.186046511627907) internal successors, (51), 49 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:57:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-11-18 20:57:52,562 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 46 [2022-11-18 20:57:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:52,563 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-11-18 20:57:52,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-11-18 20:57:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:57:52,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:52,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-11-18 20:57:52,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:57:52,566 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2085155984, now seen corresponding path program 1 times [2022-11-18 20:57:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:52,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994667370] [2022-11-18 20:57:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:57:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:57:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:57:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:52,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994667370] [2022-11-18 20:57:52,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994667370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:52,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:52,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657022225] [2022-11-18 20:57:52,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:52,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:57:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:57:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:57:52,676 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:57:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:52,707 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-11-18 20:57:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:57:52,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-18 20:57:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:52,712 INFO L225 Difference]: With dead ends: 62 [2022-11-18 20:57:52,712 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:57:52,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:57:52,713 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:52,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:57:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-18 20:57:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 49 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:57:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-11-18 20:57:52,721 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 51 [2022-11-18 20:57:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:52,722 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-11-18 20:57:52,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:57:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-11-18 20:57:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:57:52,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:52,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-11-18 20:57:52,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:57:52,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-18 20:57:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash -213541358, now seen corresponding path program 1 times [2022-11-18 20:57:52,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:52,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715600779] [2022-11-18 20:57:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:57:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-18 20:57:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 20:57:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:57:52,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:52,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715600779] [2022-11-18 20:57:52,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715600779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:57:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163168045] [2022-11-18 20:57:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:52,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:57:52,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:57:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:57:52,836 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:57:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:52,841 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-11-18 20:57:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:57:52,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-18 20:57:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:52,842 INFO L225 Difference]: With dead ends: 60 [2022-11-18 20:57:52,842 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:57:52,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-18 20:57:52,846 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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-11-18 20:57:52,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:57:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:57:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:57:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-11-18 20:57:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:57:52,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-18 20:57:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:52,849 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:57:52,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-18 20:57:52,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:57:52,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:57:52,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-18 20:57:52,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-18 20:57:52,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-18 20:57:52,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-18 20:57:52,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-18 20:57:52,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-18 20:57:52,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-18 20:57:52,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-18 20:57:52,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:57:52,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:57:53,036 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-18 20:57:53,037 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-18 20:57:53,037 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-18 20:57:53,037 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-18 20:57:53,037 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-18 20:57:53,037 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-18 20:57:53,037 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-18 20:57:53,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-18 20:57:53,038 INFO L899 garLoopResultBuilder]: For program point L1596(line 1596) no Hoare annotation was computed. [2022-11-18 20:57:53,038 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-18 20:57:53,038 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-11-18 20:57:53,038 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-18 20:57:53,039 INFO L895 garLoopResultBuilder]: At program point L1613(lines 1613 1630) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-11-18 20:57:53,039 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-18 20:57:53,039 INFO L895 garLoopResultBuilder]: At program point L1605(line 1605) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,040 INFO L899 garLoopResultBuilder]: For program point L1605-1(lines 1599 1606) no Hoare annotation was computed. [2022-11-18 20:57:53,040 INFO L902 garLoopResultBuilder]: At program point L1696(line 1696) the Hoare annotation is: true [2022-11-18 20:57:53,040 INFO L899 garLoopResultBuilder]: For program point L1696-1(line 1696) no Hoare annotation was computed. [2022-11-18 20:57:53,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-18 20:57:53,041 INFO L895 garLoopResultBuilder]: At program point L1663(lines 1663 1671) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:57:53,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:57:53,042 INFO L895 garLoopResultBuilder]: At program point L1655(line 1655) the Hoare annotation is: false [2022-11-18 20:57:53,042 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-11-18 20:57:53,042 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-18 20:57:53,043 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1589) no Hoare annotation was computed. [2022-11-18 20:57:53,043 INFO L902 garLoopResultBuilder]: At program point L1672(lines 1672 1684) the Hoare annotation is: true [2022-11-18 20:57:53,043 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-18 20:57:53,044 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-11-18 20:57:53,044 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-18 20:57:53,044 INFO L899 garLoopResultBuilder]: For program point L1590(lines 1590 1631) no Hoare annotation was computed. [2022-11-18 20:57:53,044 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-11-18 20:57:53,044 INFO L899 garLoopResultBuilder]: For program point L1681(line 1681) no Hoare annotation was computed. [2022-11-18 20:57:53,044 INFO L899 garLoopResultBuilder]: For program point L1615(line 1615) no Hoare annotation was computed. [2022-11-18 20:57:53,045 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-11-18 20:57:53,045 INFO L902 garLoopResultBuilder]: At program point L1698(line 1698) the Hoare annotation is: true [2022-11-18 20:57:53,045 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-18 20:57:53,045 INFO L899 garLoopResultBuilder]: For program point L1698-1(line 1698) no Hoare annotation was computed. [2022-11-18 20:57:53,045 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1658) no Hoare annotation was computed. [2022-11-18 20:57:53,045 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1606) no Hoare annotation was computed. [2022-11-18 20:57:53,046 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,046 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-18 20:57:53,046 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-18 20:57:53,046 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1625) no Hoare annotation was computed. [2022-11-18 20:57:53,046 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-11-18 20:57:53,046 INFO L899 garLoopResultBuilder]: For program point L1674(line 1674) no Hoare annotation was computed. [2022-11-18 20:57:53,047 INFO L899 garLoopResultBuilder]: For program point L1641(line 1641) no Hoare annotation was computed. [2022-11-18 20:57:53,047 INFO L902 garLoopResultBuilder]: At program point L1699(lines 1693 1700) the Hoare annotation is: true [2022-11-18 20:57:53,047 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-11-18 20:57:53,047 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-11-18 20:57:53,047 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-18 20:57:53,047 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-18 20:57:53,047 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:57:53,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-11-18 20:57:53,048 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1685) no Hoare annotation was computed. [2022-11-18 20:57:53,048 INFO L895 garLoopResultBuilder]: At program point L1651(line 1651) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,048 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-18 20:57:53,048 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-18 20:57:53,049 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-18 20:57:53,049 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-18 20:57:53,050 INFO L899 garLoopResultBuilder]: For program point L1676(line 1676) no Hoare annotation was computed. [2022-11-18 20:57:53,050 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-18 20:57:53,050 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: false [2022-11-18 20:57:53,051 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1586) no Hoare annotation was computed. [2022-11-18 20:57:53,051 INFO L899 garLoopResultBuilder]: For program point L1668(line 1668) no Hoare annotation was computed. [2022-11-18 20:57:53,051 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:57:53,051 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-11-18 20:57:53,051 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-18 20:57:53,052 INFO L895 garLoopResultBuilder]: At program point L1594(lines 1594 1612) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,052 INFO L895 garLoopResultBuilder]: At program point L1669(line 1669) the Hoare annotation is: false [2022-11-18 20:57:53,053 INFO L895 garLoopResultBuilder]: At program point L1636(lines 1636 1644) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) |ULTIMATE.start_goodG2B1_#t~switch102#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,053 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-18 20:57:53,053 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: false [2022-11-18 20:57:53,053 INFO L899 garLoopResultBuilder]: For program point L1686(lines 1686 1692) no Hoare annotation was computed. [2022-11-18 20:57:53,053 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,054 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-18 20:57:53,054 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-18 20:57:53,054 INFO L895 garLoopResultBuilder]: At program point L1645(lines 1645 1657) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-18 20:57:53,055 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-11-18 20:57:53,055 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-11-18 20:57:53,055 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-11-18 20:57:53,055 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1588) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch95#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-18 20:57:53,059 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:53,061 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:57:53,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:57:53 BoogieIcfgContainer [2022-11-18 20:57:53,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:57:53,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:57:53,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:57:53,087 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:57:53,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:49" (3/4) ... [2022-11-18 20:57:53,091 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:57:53,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-18 20:57:53,098 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-18 20:57:53,108 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-18 20:57:53,109 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-18 20:57:53,109 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-18 20:57:53,110 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:57:53,110 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:57:53,182 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:57:53,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:57:53,183 INFO L158 Benchmark]: Toolchain (without parser) took 5821.65ms. Allocated memory was 102.8MB in the beginning and 155.2MB in the end (delta: 52.4MB). Free memory was 66.8MB in the beginning and 61.8MB in the end (delta: 5.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,184 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 102.8MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:57:53,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1410.49ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 66.6MB in the beginning and 88.6MB in the end (delta: -22.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.19ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 85.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,185 INFO L158 Benchmark]: Boogie Preprocessor took 57.45ms. Allocated memory is still 127.9MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,186 INFO L158 Benchmark]: RCFGBuilder took 688.45ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 65.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,186 INFO L158 Benchmark]: TraceAbstraction took 3495.30ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 64.9MB in the beginning and 67.0MB in the end (delta: -2.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,187 INFO L158 Benchmark]: Witness Printer took 95.90ms. Allocated memory is still 155.2MB. Free memory was 67.0MB in the beginning and 61.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:57:53,192 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.36ms. Allocated memory is still 102.8MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1410.49ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 66.6MB in the beginning and 88.6MB in the end (delta: -22.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.19ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 85.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.45ms. Allocated memory is still 127.9MB. Free memory was 85.1MB in the beginning and 83.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.45ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 65.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3495.30ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 64.9MB in the beginning and 67.0MB in the end (delta: -2.1MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 95.90ms. Allocated memory is still 155.2MB. Free memory was 67.0MB in the beginning and 61.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 2610 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1374 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1236 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 96 PreInvPairs, 114 NumberOfFragments, 163 HoareAnnotationTreeSize, 96 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 104/104 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1636]: Loop Invariant Derived loop invariant: ((2 == data && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = 2; break; }-aux) && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data < 0x7fffffff) { data++; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1613]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data < 0x7fffffff) { data++; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1693]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1645]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: { data++; int result = data; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1663]: Loop Invariant Derived loop invariant: (0 <= data + 2147483648 && data == 2) && 0 <= data + 2147483648 RESULT: Ultimate proved your program to be correct! [2022-11-18 20:57:53,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ec7b32-eeb0-4fb6-981d-0fc56911654d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE