./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8 --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 eae29037f39f72e492ffc0d4d80667eddad5a4a3f1ba42f69f0f22dd69021a00 --- 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-2329fc7 [2022-12-13 15:58:30,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:58:30,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:58:30,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:58:30,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:58:30,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:58:30,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:58:30,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:58:30,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:58:30,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:58:30,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:58:30,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:58:30,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:58:30,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:58:30,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:58:30,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:58:30,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:58:30,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:58:30,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:58:30,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:58:30,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:58:30,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:58:30,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:58:30,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:58:30,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:58:30,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:58:30,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:58:30,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:58:30,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:58:30,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:58:30,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:58:30,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:58:30,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:58:30,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:58:30,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:58:30,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:58:30,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:58:30,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:58:30,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:58:30,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:58:30,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:58:30,726 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 15:58:30,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:58:30,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:58:30,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:58:30,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:58:30,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:58:30,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:58:30,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:58:30,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:58:30,741 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:58:30,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:58:30,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:58:30,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:58:30,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:58:30,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:58:30,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:58:30,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:58:30,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:58:30,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:58:30,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:58:30,744 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/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_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8 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 -> eae29037f39f72e492ffc0d4d80667eddad5a4a3f1ba42f69f0f22dd69021a00 [2022-12-13 15:58:30,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:58:30,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:58:30,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:58:30,919 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:58:30,920 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:58:30,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2022-12-13 15:58:33,530 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:58:33,666 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:58:33,667 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2022-12-13 15:58:33,671 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/data/6a67b4ea1/230645eafd1a499ab8fae7533a70ae39/FLAGa0454dd36 [2022-12-13 15:58:33,682 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/data/6a67b4ea1/230645eafd1a499ab8fae7533a70ae39 [2022-12-13 15:58:33,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:58:33,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:58:33,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:58:33,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:58:33,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:58:33,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9e156c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33, skipping insertion in model container [2022-12-13 15:58:33,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:58:33,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:58:33,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:58:33,830 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:58:33,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:58:33,852 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:58:33,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33 WrapperNode [2022-12-13 15:58:33,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:58:33,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:58:33,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:58:33,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:58:33,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,874 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2022-12-13 15:58:33,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:58:33,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:58:33,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:58:33,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:58:33,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,888 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:58:33,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:58:33,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:58:33,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:58:33,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (1/1) ... [2022-12-13 15:58:33,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:58:33,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:58:33,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:58:33,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:58:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:58:33,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:58:34,008 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:58:34,010 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:58:34,179 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:58:34,185 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:58:34,185 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 15:58:34,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:58:34 BoogieIcfgContainer [2022-12-13 15:58:34,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:58:34,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:58:34,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:58:34,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:58:34,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:58:33" (1/3) ... [2022-12-13 15:58:34,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478329d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:58:34, skipping insertion in model container [2022-12-13 15:58:34,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:58:33" (2/3) ... [2022-12-13 15:58:34,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478329d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:58:34, skipping insertion in model container [2022-12-13 15:58:34,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:58:34" (3/3) ... [2022-12-13 15:58:34,194 INFO L112 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-1.c [2022-12-13 15:58:34,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:58:34,208 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-12-13 15:58:34,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:58:34,251 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;@7abad987, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:58:34,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-12-13 15:58:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 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-12-13 15:58:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 15:58:34,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:34,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 15:58:34,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 28694083, now seen corresponding path program 1 times [2022-12-13 15:58:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:34,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479678726] [2022-12-13 15:58:34,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:34,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:34,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479678726] [2022-12-13 15:58:34,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479678726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:34,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:34,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:58:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438304522] [2022-12-13 15:58:34,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:34,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:58:34,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:58:34,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:58:34,428 INFO L87 Difference]: Start difference. First operand has 88 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:34,596 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-12-13 15:58:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:58:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 15:58:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:34,603 INFO L225 Difference]: With dead ends: 182 [2022-12-13 15:58:34,604 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 15:58:34,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-13 15:58:34,608 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:34,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 55 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 15:58:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2022-12-13 15:58:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2022-12-13 15:58:34,635 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 5 [2022-12-13 15:58:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:34,636 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2022-12-13 15:58:34,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-12-13 15:58:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 15:58:34,636 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:34,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 15:58:34,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:58:34,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash 28696005, now seen corresponding path program 1 times [2022-12-13 15:58:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:34,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142781809] [2022-12-13 15:58:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142781809] [2022-12-13 15:58:34,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142781809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:34,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:34,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:58:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694255096] [2022-12-13 15:58:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:58:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:58:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:58:34,662 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:34,752 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-12-13 15:58:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:58:34,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 15:58:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:34,753 INFO L225 Difference]: With dead ends: 93 [2022-12-13 15:58:34,754 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 15:58:34,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:58:34,755 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:34,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 42 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 15:58:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-12-13 15:58:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-13 15:58:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2022-12-13 15:58:34,762 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 5 [2022-12-13 15:58:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:34,763 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2022-12-13 15:58:34,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2022-12-13 15:58:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 15:58:34,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:34,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 15:58:34,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:58:34,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:34,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash 889510666, now seen corresponding path program 1 times [2022-12-13 15:58:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:34,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860598599] [2022-12-13 15:58:34,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860598599] [2022-12-13 15:58:34,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860598599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:34,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:34,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:58:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000167867] [2022-12-13 15:58:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:34,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:58:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:58:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:58:34,799 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:34,891 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-12-13 15:58:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:58:34,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 15:58:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:34,893 INFO L225 Difference]: With dead ends: 113 [2022-12-13 15:58:34,893 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 15:58:34,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:58:34,895 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:34,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 15:58:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-12-13 15:58:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-12-13 15:58:34,901 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 6 [2022-12-13 15:58:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:34,901 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-12-13 15:58:34,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-12-13 15:58:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 15:58:34,902 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:34,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:58:34,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 184244016, now seen corresponding path program 1 times [2022-12-13 15:58:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:34,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890759644] [2022-12-13 15:58:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890759644] [2022-12-13 15:58:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890759644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:34,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:58:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839423520] [2022-12-13 15:58:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:58:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:34,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:58:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:58:34,939 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,017 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-12-13 15:58:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:58:35,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 15:58:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,018 INFO L225 Difference]: With dead ends: 97 [2022-12-13 15:58:35,018 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 15:58:35,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:58:35,019 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 33 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 15:58:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-12-13 15:58:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2022-12-13 15:58:35,024 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 8 [2022-12-13 15:58:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,024 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2022-12-13 15:58:35,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2022-12-13 15:58:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 15:58:35,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:58:35,025 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash -535910833, now seen corresponding path program 1 times [2022-12-13 15:58:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325973510] [2022-12-13 15:58:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325973510] [2022-12-13 15:58:35,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325973510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:58:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785313205] [2022-12-13 15:58:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:58:35,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:58:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:58:35,060 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,171 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-12-13 15:58:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:58:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 15:58:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,172 INFO L225 Difference]: With dead ends: 129 [2022-12-13 15:58:35,172 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 15:58:35,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:58:35,174 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 66 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 43 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 15:58:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2022-12-13 15:58:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 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-12-13 15:58:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-12-13 15:58:35,182 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 9 [2022-12-13 15:58:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,182 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-12-13 15:58:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-12-13 15:58:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 15:58:35,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:58:35,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash -154658765, now seen corresponding path program 1 times [2022-12-13 15:58:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338486008] [2022-12-13 15:58:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338486008] [2022-12-13 15:58:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338486008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:58:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564703644] [2022-12-13 15:58:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:58:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:58:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:58:35,239 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,291 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-12-13 15:58:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:58:35,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 15:58:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,291 INFO L225 Difference]: With dead ends: 111 [2022-12-13 15:58:35,291 INFO L226 Difference]: Without dead ends: 110 [2022-12-13 15:58:35,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:58:35,293 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 29 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:58:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-13 15:58:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-12-13 15:58:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 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-12-13 15:58:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-12-13 15:58:35,299 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 11 [2022-12-13 15:58:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,300 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-12-13 15:58:35,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-12-13 15:58:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 15:58:35,300 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:58:35,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -926118088, now seen corresponding path program 1 times [2022-12-13 15:58:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765836310] [2022-12-13 15:58:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765836310] [2022-12-13 15:58:35,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765836310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:58:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217695262] [2022-12-13 15:58:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:58:35,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:58:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:58:35,348 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,441 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-12-13 15:58:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:58:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 15:58:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,442 INFO L225 Difference]: With dead ends: 150 [2022-12-13 15:58:35,442 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 15:58:35,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:58:35,443 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 40 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 15:58:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 110. [2022-12-13 15:58:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 109 states have internal predecessors, (119), 0 states have call successors, (0), 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-12-13 15:58:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-12-13 15:58:35,449 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 12 [2022-12-13 15:58:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,450 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-12-13 15:58:35,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-12-13 15:58:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 15:58:35,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:58:35,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1060719262, now seen corresponding path program 1 times [2022-12-13 15:58:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054237952] [2022-12-13 15:58:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054237952] [2022-12-13 15:58:35,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054237952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:58:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58507993] [2022-12-13 15:58:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:58:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:58:35,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:58:35,499 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,547 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-12-13 15:58:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:58:35,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 15:58:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,548 INFO L225 Difference]: With dead ends: 119 [2022-12-13 15:58:35,548 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 15:58:35,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:58:35,549 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 96 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 23 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:58:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 15:58:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2022-12-13 15:58:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 108 states have internal predecessors, (118), 0 states have call successors, (0), 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-12-13 15:58:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-12-13 15:58:35,553 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 14 [2022-12-13 15:58:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,553 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-12-13 15:58:35,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-12-13 15:58:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 15:58:35,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:58:35,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 886032381, now seen corresponding path program 1 times [2022-12-13 15:58:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846415083] [2022-12-13 15:58:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846415083] [2022-12-13 15:58:35,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846415083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:58:35,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169448189] [2022-12-13 15:58:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:58:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:58:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:58:35,598 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,729 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2022-12-13 15:58:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:58:35,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 15:58:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,730 INFO L225 Difference]: With dead ends: 168 [2022-12-13 15:58:35,730 INFO L226 Difference]: Without dead ends: 163 [2022-12-13 15:58:35,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:58:35,731 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 38 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-12-13 15:58:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 112. [2022-12-13 15:58:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.21) internal successors, (121), 111 states have internal predecessors, (121), 0 states have call successors, (0), 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-12-13 15:58:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2022-12-13 15:58:35,736 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 15 [2022-12-13 15:58:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,736 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2022-12-13 15:58:35,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-12-13 15:58:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 15:58:35,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:58:35,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1813230241, now seen corresponding path program 1 times [2022-12-13 15:58:35,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017868769] [2022-12-13 15:58:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017868769] [2022-12-13 15:58:35,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017868769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:58:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163958909] [2022-12-13 15:58:35,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:58:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:58:35,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:58:35,791 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:35,876 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-12-13 15:58:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:58:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 15:58:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:35,876 INFO L225 Difference]: With dead ends: 121 [2022-12-13 15:58:35,876 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 15:58:35,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:58:35,877 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:35,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 23 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 15:58:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2022-12-13 15:58:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.2) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2022-12-13 15:58:35,880 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 17 [2022-12-13 15:58:35,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:35,880 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2022-12-13 15:58:35,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2022-12-13 15:58:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 15:58:35,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:35,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:35,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:58:35,882 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:35,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:35,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1078242458, now seen corresponding path program 1 times [2022-12-13 15:58:35,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:35,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587213964] [2022-12-13 15:58:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:35,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587213964] [2022-12-13 15:58:35,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587213964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:35,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:35,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:58:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219244697] [2022-12-13 15:58:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:35,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:58:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:58:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:58:35,920 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:36,072 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2022-12-13 15:58:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:58:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 15:58:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:36,073 INFO L225 Difference]: With dead ends: 183 [2022-12-13 15:58:36,073 INFO L226 Difference]: Without dead ends: 179 [2022-12-13 15:58:36,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:58:36,074 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 123 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:36,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 43 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-13 15:58:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 108. [2022-12-13 15:58:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 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-12-13 15:58:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-12-13 15:58:36,079 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2022-12-13 15:58:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:36,079 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-12-13 15:58:36,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-12-13 15:58:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 15:58:36,080 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:36,080 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] [2022-12-13 15:58:36,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:58:36,080 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash 138534412, now seen corresponding path program 1 times [2022-12-13 15:58:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260113389] [2022-12-13 15:58:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:36,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260113389] [2022-12-13 15:58:36,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260113389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:36,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:36,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:58:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588281421] [2022-12-13 15:58:36,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:36,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:58:36,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:58:36,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:58:36,141 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:36,221 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-12-13 15:58:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:58:36,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 15:58:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:36,222 INFO L225 Difference]: With dead ends: 117 [2022-12-13 15:58:36,223 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 15:58:36,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:58:36,224 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:36,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 21 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 15:58:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-12-13 15:58:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 98 states have (on average 1.183673469387755) internal successors, (116), 106 states have internal predecessors, (116), 0 states have call successors, (0), 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-12-13 15:58:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-12-13 15:58:36,227 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2022-12-13 15:58:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:36,228 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-12-13 15:58:36,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-12-13 15:58:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 15:58:36,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:36,229 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] [2022-12-13 15:58:36,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:58:36,229 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash 139450795, now seen corresponding path program 1 times [2022-12-13 15:58:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:36,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496254806] [2022-12-13 15:58:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:36,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496254806] [2022-12-13 15:58:36,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496254806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:36,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:36,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:58:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143152222] [2022-12-13 15:58:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:36,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:58:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:58:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:58:36,288 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:36,471 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2022-12-13 15:58:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:58:36,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-13 15:58:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:36,473 INFO L225 Difference]: With dead ends: 195 [2022-12-13 15:58:36,473 INFO L226 Difference]: Without dead ends: 192 [2022-12-13 15:58:36,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:58:36,474 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 180 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:36,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 35 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:58:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-13 15:58:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 98. [2022-12-13 15:58:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-12-13 15:58:36,478 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2022-12-13 15:58:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:36,478 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-12-13 15:58:36,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-12-13 15:58:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 15:58:36,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:36,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:36,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:58:36,479 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash -384783089, now seen corresponding path program 1 times [2022-12-13 15:58:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:36,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959617769] [2022-12-13 15:58:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:36,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959617769] [2022-12-13 15:58:36,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959617769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:36,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:36,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:58:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879154011] [2022-12-13 15:58:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:36,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:58:36,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:36,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:58:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:58:36,549 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:36,643 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-12-13 15:58:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:58:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 15:58:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:36,644 INFO L225 Difference]: With dead ends: 107 [2022-12-13 15:58:36,644 INFO L226 Difference]: Without dead ends: 106 [2022-12-13 15:58:36,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:58:36,645 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:36,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 15 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-13 15:58:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-12-13 15:58:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-12-13 15:58:36,649 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 23 [2022-12-13 15:58:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:36,649 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-12-13 15:58:36,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-12-13 15:58:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 15:58:36,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:36,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:36,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:58:36,650 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1145382804, now seen corresponding path program 1 times [2022-12-13 15:58:36,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:36,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210764272] [2022-12-13 15:58:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:36,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:36,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210764272] [2022-12-13 15:58:36,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210764272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:36,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:36,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:58:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121697978] [2022-12-13 15:58:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:36,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:58:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:58:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:58:36,713 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:36,897 INFO L93 Difference]: Finished difference Result 204 states and 213 transitions. [2022-12-13 15:58:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:58:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 15:58:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:36,899 INFO L225 Difference]: With dead ends: 204 [2022-12-13 15:58:36,899 INFO L226 Difference]: Without dead ends: 202 [2022-12-13 15:58:36,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:58:36,900 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 164 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:36,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 41 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:58:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-12-13 15:58:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 82. [2022-12-13 15:58:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-13 15:58:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-12-13 15:58:36,903 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 24 [2022-12-13 15:58:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:36,903 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-12-13 15:58:36,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-12-13 15:58:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 15:58:36,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:36,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:36,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:58:36,905 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash 194843002, now seen corresponding path program 1 times [2022-12-13 15:58:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:36,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149490408] [2022-12-13 15:58:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:36,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149490408] [2022-12-13 15:58:36,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149490408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:36,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:36,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 15:58:36,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722059280] [2022-12-13 15:58:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:36,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 15:58:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:36,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 15:58:36,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:58:36,992 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:37,072 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-12-13 15:58:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:58:37,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 15:58:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:37,073 INFO L225 Difference]: With dead ends: 91 [2022-12-13 15:58:37,073 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 15:58:37,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:58:37,074 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:37,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 9 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 15:58:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2022-12-13 15:58:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-13 15:58:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-12-13 15:58:37,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 26 [2022-12-13 15:58:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:37,077 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-12-13 15:58:37,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-12-13 15:58:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 15:58:37,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:37,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:37,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 15:58:37,078 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1415914663, now seen corresponding path program 1 times [2022-12-13 15:58:37,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:37,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394860738] [2022-12-13 15:58:37,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:37,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:37,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394860738] [2022-12-13 15:58:37,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394860738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:37,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:37,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 15:58:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032553240] [2022-12-13 15:58:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:37,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 15:58:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 15:58:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:58:37,154 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:37,341 INFO L93 Difference]: Finished difference Result 210 states and 219 transitions. [2022-12-13 15:58:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:58:37,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 15:58:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:37,343 INFO L225 Difference]: With dead ends: 210 [2022-12-13 15:58:37,343 INFO L226 Difference]: Without dead ends: 209 [2022-12-13 15:58:37,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:58:37,344 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 187 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:37,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 39 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:58:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-12-13 15:58:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 60. [2022-12-13 15:58:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 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-12-13 15:58:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-12-13 15:58:37,347 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 27 [2022-12-13 15:58:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:37,347 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-12-13 15:58:37,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:58:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-12-13 15:58:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 15:58:37,347 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:37,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:37,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 15:58:37,348 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:37,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash 810646747, now seen corresponding path program 1 times [2022-12-13 15:58:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:37,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556846040] [2022-12-13 15:58:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:58:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:58:37,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:58:37,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556846040] [2022-12-13 15:58:37,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556846040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:58:37,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:58:37,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:58:37,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947893873] [2022-12-13 15:58:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:58:37,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:58:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:58:37,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:58:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:58:37,395 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-12-13 15:58:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:58:37,482 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-12-13 15:58:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:58:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 15:58:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:58:37,483 INFO L225 Difference]: With dead ends: 87 [2022-12-13 15:58:37,483 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 15:58:37,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:58:37,484 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:58:37,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 39 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:58:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 15:58:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 62. [2022-12-13 15:58:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-13 15:58:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-12-13 15:58:37,486 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 29 [2022-12-13 15:58:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:58:37,486 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-12-13 15:58:37,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-12-13 15:58:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-12-13 15:58:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 15:58:37,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:58:37,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:37,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 15:58:37,487 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-13 15:58:37,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:58:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2067203933, now seen corresponding path program 1 times [2022-12-13 15:58:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:58:37,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317897689] [2022-12-13 15:58:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:58:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:58:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:58:37,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:58:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:58:37,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:58:37,516 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:58:37,517 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 36 remaining) [2022-12-13 15:58:37,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 36 remaining) [2022-12-13 15:58:37,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 36 remaining) [2022-12-13 15:58:37,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 36 remaining) [2022-12-13 15:58:37,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 36 remaining) [2022-12-13 15:58:37,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 36 remaining) [2022-12-13 15:58:37,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 36 remaining) [2022-12-13 15:58:37,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 36 remaining) [2022-12-13 15:58:37,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 36 remaining) [2022-12-13 15:58:37,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 36 remaining) [2022-12-13 15:58:37,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 36 remaining) [2022-12-13 15:58:37,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 36 remaining) [2022-12-13 15:58:37,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 36 remaining) [2022-12-13 15:58:37,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 36 remaining) [2022-12-13 15:58:37,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 15:58:37,526 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:58:37,530 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:58:37,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:58:37 BoogieIcfgContainer [2022-12-13 15:58:37,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:58:37,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:58:37,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:58:37,550 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:58:37,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:58:34" (3/4) ... [2022-12-13 15:58:37,552 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 15:58:37,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 15:58:37,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:58:37,578 INFO L158 Benchmark]: Toolchain (without parser) took 3892.48ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 108.5MB in the beginning and 57.5MB in the end (delta: 51.0MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2022-12-13 15:58:37,578 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:58:37,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.17ms. Allocated memory is still 140.5MB. Free memory was 108.5MB in the beginning and 98.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 15:58:37,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.68ms. Allocated memory is still 140.5MB. Free memory was 98.6MB in the beginning and 96.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:58:37,578 INFO L158 Benchmark]: Boogie Preprocessor took 15.08ms. Allocated memory is still 140.5MB. Free memory was 96.9MB in the beginning and 96.1MB in the end (delta: 841.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:58:37,579 INFO L158 Benchmark]: RCFGBuilder took 296.08ms. Allocated memory is still 140.5MB. Free memory was 96.1MB in the beginning and 82.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 15:58:37,579 INFO L158 Benchmark]: TraceAbstraction took 3360.92ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 81.4MB in the beginning and 59.6MB in the end (delta: 21.8MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2022-12-13 15:58:37,579 INFO L158 Benchmark]: Witness Printer took 27.71ms. Allocated memory is still 192.9MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:58:37,580 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.17ms. Allocated memory is still 140.5MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.17ms. Allocated memory is still 140.5MB. Free memory was 108.5MB in the beginning and 98.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.68ms. Allocated memory is still 140.5MB. Free memory was 98.6MB in the beginning and 96.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.08ms. Allocated memory is still 140.5MB. Free memory was 96.9MB in the beginning and 96.1MB in the end (delta: 841.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 296.08ms. Allocated memory is still 140.5MB. Free memory was 96.1MB in the beginning and 82.3MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3360.92ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 81.4MB in the beginning and 59.6MB in the end (delta: 21.8MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * Witness Printer took 27.71ms. Allocated memory is still 192.9MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483648, z=0] [L24] COND FALSE !(x > 0) VAL [x=-1, y=-2147483648, z=0] [L27] EXPR x - 1 [L27] x = x - 1 VAL [x=-2, y=-2147483648, z=0] [L29] COND FALSE !(x > 0) VAL [x=-2, y=-2147483648, z=0] [L32] EXPR x - 1 [L32] x = x - 1 VAL [x=-3, y=-2147483648, z=0] [L34] COND FALSE !(x > 0) VAL [x=-3, y=-2147483648, z=0] [L37] EXPR x - 1 [L37] x = x - 1 VAL [x=-4, y=-2147483648, z=0] [L39] COND FALSE !(x > 0) VAL [x=-4, y=-2147483648, z=0] [L42] EXPR x - 1 [L42] x = x - 1 VAL [x=-5, y=-2147483648, z=0] [L44] COND FALSE !(x > 0) VAL [x=-5, y=-2147483648, z=0] [L47] EXPR x - 1 [L47] x = x - 1 VAL [x=-6, y=-2147483648, z=0] [L49] COND FALSE !(x > 0) VAL [x=-6, y=-2147483648, z=0] [L52] EXPR x - 1 [L52] x = x - 1 VAL [x=-7, y=-2147483648, z=0] [L54] COND FALSE !(x > 0) VAL [x=-7, y=-2147483648, z=0] [L57] EXPR x - 1 [L57] x = x - 1 VAL [x=-8, y=-2147483648, z=0] [L59] COND FALSE !(x > 0) VAL [x=-8, y=-2147483648, z=0] [L62] EXPR x - 1 [L62] x = x - 1 VAL [x=-9, y=-2147483648, z=0] [L64] COND TRUE y<100 && z<100 VAL [x=-9, y=-2147483648, z=0] [L65] y+x VAL [x=-9, y=-2147483648, z=0] - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1559 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1559 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3632 IncrementalHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 479 mSDtfsCounter, 3632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=9, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 653 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 15:58:37,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8cca419b-ea5e-4b58-b04d-3cdaf8dd7674/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)